English

Stable Tables

Probability 2024-11-18 v1 Combinatorics

Abstract

We consider equilibrium one-on-one conversations between neighbors on a circular table, with the goal of assessing the likelihood of a (perhaps) familiar situation: sitting at a table where both of your neighbors are talking to someone else. When nn people in a circle randomly prefer their left or right neighbor, we show that the probability a given person is unmatched in equilibrium (i.e., in a stable matching) is 19+(12)n(2n389+2n)\frac{1}{9} + \left(\frac{1}{2}\right)^n\left(\frac{2n}{3} - \frac{8}{9} + \frac{2}{n}\right) for odd nn and 19(12)n(2n389)\frac{1}{9} - \left(\frac{1}{2}\right)^n\left(\frac{2n}{3} - \frac{8}{9}\right) for even nn. This probability approaches 1/91/9 as nn\rightarrow \infty. We also show that the probability \textit{every} person is matched in equilibrium is 00 for odd nn and 3n/212n1\frac{3^{n/2}-1}{2^{n-1}} for even nn.

Keywords

Cite

@article{arxiv.2411.09716,
  title  = {Stable Tables},
  author = {Kenny Peng},
  journal= {arXiv preprint arXiv:2411.09716},
  year   = {2024}
}