On the Approximability of the Yolk in the Spatial Model of Voting
Ran Hu, James P. Bailey

TL;DR
This paper investigates the relationship between the yolk and LP yolk in the spatial voting model, showing bounds on their sizes and highlighting limitations of LP yolk as an approximation.
Contribution
It establishes bounds on the yolk size relative to the LP yolk and demonstrates scenarios where LP yolk is a poor approximation, extending understanding of voting solution concepts.
Findings
Yolk radius is at most twice the LP yolk radius for odd voters in 2D.
LP yolk center can be arbitrarily far from the yolk center.
LP yolk can be arbitrarily small relative to the yolk in other settings.
Abstract
In the spatial model of voting, the yolk and LP (linear programming) yolk are important solution concepts for predicting outcomes for a committee of voters. McKelvey and Tovey showed that the LP yolk provides a lower bound approximation for the size of the yolk and there has been considerable debate on whether the LP yolk is a good approximation of the yolk. In this paper, we show that for an odd number of voters in a two-dimensional space that the yolk radius is at most twice the size of the LP yolk radius. However, we also show that (1) even in this setting, the LP yolk center can be arbitrarily far away from the yolk center (relative to the radius of the yolk) and (2) for all other settings (an even number of voters or in dimension ) that the LP yolk can be arbitrarily small relative to the yolk. Thus, in general, the LP yolk can be an arbitrarily poor approximation of the…
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.
Taxonomy
TopicsGame Theory and Voting Systems · advanced mathematical theories
