EconPapers    
Economics at your fingertips  
 

Eliciting the socially optimal allocation from responsible agents

Battal Dogan

Journal of Mathematical Economics, 2017, vol. 73, issue C, 103-110

Abstract: We consider designing a mechanism to allocate objects among agents without monetary transfers. There is a socially optimal allocation, which is commonly known by the agents but not observable by the designer. The designer possibly has information about the existence of responsible agents. A responsible agent, when indifferent between his objects at two different allocations, prefers the first allocation to the second if the first allocation is closer to the optimal allocation than the second, in the sense that all the agents who are allocated their optimal objects in the second allocation are allocated their optimal objects also in the first allocation, and there is at least one more agent in the first allocation receiving his optimal object. We show that, if the designer knows that there are at least three responsible agents, even if the identities of the responsible agents are not known, the optimal allocation can be elicited.

Keywords: Nash equilibrium; Implementation; Responsible agents (search for similar items in EconPapers)
Date: 2017
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (3)

Downloads: (external link)
http://www.sciencedirect.com/science/article/pii/S0304406817301131
Full text for ScienceDirect subscribers only

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:eee:mateco:v:73:y:2017:i:c:p:103-110

DOI: 10.1016/j.jmateco.2017.09.001

Access Statistics for this article

Journal of Mathematical Economics is currently edited by Atsushi (A.) Kajii

More articles in Journal of Mathematical Economics from Elsevier
Bibliographic data for series maintained by Catherine Liu ().

 
Page updated 2025-03-19
Handle: RePEc:eee:mateco:v:73:y:2017:i:c:p:103-110