CORR
2010
Springer
13 years 3 months ago
2010
Springer
Following Babaioff, Kleinberg, and Slivkins [4], we study single-call mechanisms — truthful mechanisms that evaluate an allocation function only once per instantiation. First, w...
SIGECOM
2010
ACM
13 years 9 months ago
2010
ACM
It is widely believed that computing payments needed to induce truthful bidding is somehow harder than simply computing the allocation. We show that the opposite is true for singl...
ATAL
2009
Springer
13 years 11 months ago
2009
Springer
A combinatorial auction mechanism consists of an allocation rule that defines the allocation of goods for each agent, and a payment rule that defines the payment of each winner....