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 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 for odd and for even . This probability approaches as . We also show that the probability \textit{every} person is matched in equilibrium is for odd and for even .
Keywords
Cite
@article{arxiv.2411.09716,
title = {Stable Tables},
author = {Kenny Peng},
journal= {arXiv preprint arXiv:2411.09716},
year = {2024}
}