Randomized Strategyproof Mechanisms with Best of Both Worlds Fairness and Efficiency

We study the problem of mechanism design for allocating a set of indivisible items among agents with private preferences on items. We are interested in such a mechanism that is strategyproof (where agents' best strategy is to report their true preferences) and is expected to ensure fairness and...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Sun, Ankang, Chen, Bo
Format:	Artikel
Sprache:	eng
Schlagworte:	Computer Science - Computer Science and Game Theory
Online-Zugang:	Volltext bestellen
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!