Undominated Groves Mechanisms
Mingyu Guo, Evangelos Markakis, Krzysztof R. Apt, Vincent Conitzer

TL;DR
This paper investigates non-deficit Groves mechanisms, defining and analyzing individually and collectively undominated mechanisms to maximize agents' utilities without incurring deficits.
Contribution
It introduces the concepts of individually and collectively undominated Groves mechanisms and studies their properties within a prior-free, non-deficit setting.
Findings
Defined measures for comparing mechanisms in prior-free settings.
Identified and characterized maximal elements called undominated mechanisms.
Established partial orders on non-deficit Groves mechanisms.
Abstract
The family of Groves mechanisms, which includes the well-known VCG mechanism (also known as the Clarke mechanism), is a family of efficient and strategy-proof mechanisms. Unfortunately, the Groves mechanisms are generally not budget balanced. That is, under such mechanisms, payments may flow into or out of the system of the agents, resulting in deficits or reduced utilities for the agents. We consider the following problem: within the family of Groves mechanisms, we want to identify mechanisms that give the agents the highest utilities, under the constraint that these mechanisms must never incur deficits. We adopt a prior-free approach. We introduce two general measures for comparing mechanisms in prior-free settings. We say that a non-deficit Groves mechanism {\em individually dominates} another non-deficit Groves mechanism if for every type profile, every agent's utility…
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
TopicsAuction Theory and Applications · Game Theory and Voting Systems · Game Theory and Applications
