Percolation for the stable marriage of Poisson and Lebesgue with random appetites
Daniel Andr\'es D\'iaz-Pach\'on

TL;DR
This paper investigates the percolation properties of a stable marriage model in continuous space where centers with random appetites are allocated regions, showing that small appetites prevent percolation under certain conditions.
Contribution
It generalizes previous models by incorporating random appetites and establishes conditions under which percolation does not occur.
Findings
Percolation is absent for small enough appetites.
The results depend on the moments of the random appetite distribution.
Extends prior work on stable allocations with deterministic appetites.
Abstract
Let be a set of centers chosen according to a Poisson point process in . Consider the allocation of to which is stable in the sense of the Gale-Shapley marriage problem, with the additional feature that every center has a random appetite , where is a nonnegative scale constant and is a nonnegative random variable. Generalizing previous results by Freire, Popov and Vachkovskaia (\cite{FPV}), we show the absence of percolation when is small enough, depending on certain characteristics of the moment of .
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
