Pareto Efficient Nash Implementation Via Approval Voting
Yakov Babichenko, Leonard J. Schulman

TL;DR
This paper demonstrates that a modified approval voting mechanism can effectively select Pareto efficient social choices as pure Nash equilibria in a two-player setting with lottery outputs, providing a precise equilibrium characterization.
Contribution
It introduces a variant of approval voting that ensures Pareto efficiency in Nash equilibria and characterizes all equilibrium profiles and outcomes.
Findings
Approval voting variant selects Pareto efficient outcomes
Exact equilibrium characterization linked to average fixed points
Mechanism achieves implementation with lottery outputs
Abstract
We study implementation of a social choice correspondence in the case of two players who have von Neumann - Morgenstern utilities over a finite set of social alternatives, and the mechanism is allowed to output lotteries. Our main positive result shows that a close variant of the popular approval voting mechanism succeeds in selecting only Pareto efficient alternatives as pure Nash equilibria outcomes. Moreover, we provide an exact characterization of pure Nash equilibria profiles and outcomes of the mechanism. The characterization demonstrates a close connection between the approval voting mechanism and the notion of average fixed point, which is a point that is equal to the average of all points that it does not Pareto dominate.
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 · Game Theory and Applications · Auction Theory and Applications
