Quantum mechanism helps agents combat Pareto-inefficient social choice rules
AbstractQuantum strategies have been successfully applied in game theory for years. However, as a reverse problem of game theory, the theory of mechanism design is ignored by physicists. In this paper, we generalize the classical theory of mechanism design to a quantum domain and obtain two results: 1) We find that the mechanism in the proof of Maskin's sufficiency theorem is built on the Prisoners' Dilemma. 2) By virtue of a quantum mechanism, agents who satisfy a certain condition can combat Pareto-inefficient social choice rules instead of being restricted by the traditional mechanism design theory.
Download InfoIf you experience problems downloading a file, check if you have the proper application to view it first. In case of further problems read the IDEAS help page. Note that these files are not on the IDEAS site. Please be patient as the files may be large.
Bibliographic InfoPaper provided by University Library of Munich, Germany in its series MPRA Paper with number 21552.
Date of creation: 18 Feb 2010
Date of revision:
Quantum games; Mechanism design; Implementation theory; Nash implementation; Maskin monotonicity;
Find related papers by JEL classification:
- D71 - Microeconomics - - Analysis of Collective Decision-Making - - - Social Choice; Clubs; Committees; Associations
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
This paper has been announced in the following NEP Reports:
- NEP-ALL-2010-04-04 (All new papers)
- NEP-CDM-2010-04-04 (Collective Decision-Making)
- NEP-GTH-2010-04-04 (Game Theory)
- NEP-HPE-2010-04-04 (History & Philosophy of Economics)
You can help add them by filling out this form.
For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: (Ekkehart Schlicht).
If references are entirely missing, you can add them using this form.