Quantum mechanism helps agents combat Pareto-inefficient social choice rules
Quantum 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.
|Date of creation:||18 Feb 2010|
|Date of revision:|
|Contact details of provider:|| Postal: |
Web page: https://mpra.ub.uni-muenchen.de
More information through EDIRC
When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:21552. See general information about how to correct material in RePEc.
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.