Models for Truthful Online Double Auctions

Online double auctions (DAs) model a dynamic two-sided matching problem with private information and self-interest, and are relevant for dynamic resource and task allocation problems. We present a general method to design truthful DAs, such that no agent can benefit from misreporting its arrival tim...

Ausführliche Beschreibung

Bibliographische Detailangaben

Hauptverfasser:	Bredin, Jonathan, Parkes, David C
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!