EconPapers    
Economics at your fingertips  
 

Multiagent Mechanism Design Without Money

Santiago R. Balseiro (), Huseyin Gurkan () and Peng Sun ()
Additional contact information
Santiago R. Balseiro: Graduate School of Business, Columbia University, New York, New York 10027
Huseyin Gurkan: Fuqua School of Business, Duke University, Durham, North Carolina 27708
Peng Sun: Fuqua School of Business, Duke University, Durham, North Carolina 27708

Operations Research, 2019, vol. 67, issue 5, 1417-1436

Abstract: We consider a principal repeatedly allocating a single resource in each period to one of multiple agents, whose values are private, without relying on monetary payments over an infinite horizon with discounting. We design a dynamic mechanism that induces agents to report their values truthfully in each period via promises/threats of future favorable/unfavorable allocations. We show that our mechanism asymptotically achieves the first-best efficient allocation (the welfare-maximizing allocation as if values are public) as agents become more patient and provide sharp characterizations of convergence rates to first best as a function of the discount factor. In particular, in the case of two agents we prove that the convergence rate of our mechanism is optimal—that is, no other mechanism can converge faster to first best.

Keywords: dynamic mechanism design; social efficiency; multiagent games; resource allocation without money (search for similar items in EconPapers)
Date: 2019
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (13)

Downloads: (external link)
https://doi.org/opre.2018.1820 (application/pdf)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:inm:oropre:v:67:y:2019:i:5:p:1417-1436

Access Statistics for this article

More articles in Operations Research from INFORMS Contact information at EDIRC.
Bibliographic data for series maintained by Chris Asher ().

 
Page updated 2025-04-17
Handle: RePEc:inm:oropre:v:67:y:2019:i:5:p:1417-1436