IDEAS home Printed from https://ideas.repec.org/p/pra/mprapa/22402.html
   My bibliography  Save this paper

A classical algorithm to break through Maskin's theorem for small-scale cases

Author

Listed:
  • Wu, Haoyang

Abstract

Quantum mechanics has been applied to game theory for years. A recent work [H. Wu, Quantum mechanism helps agents combat ``bad'' social choice rules. \emph{International Journal of Quantum Information}, 2010 (accepted). Also see http://arxiv.org/pdf/1002.4294v3] has generalized quantum mechanics to the theory of mechanism design (a reverse problem of game theory). Although the quantum mechanism is theoretically feasible, agents cannot benefit from it immediately due to the restriction of current experimental technologies. In this paper, a classical algorithm is proposed to help agents combat ``bad'' social choice rules immediately. The algorithm works well when the number of agents is not very large (e.g., less than 20). Since this condition is acceptable for small-scale cases, it can be concluded that the Maskin's sufficiency theorem has been broken through for small-scale cases just right now. In the future, when the experimental technologies for quantum information are commercially available, the Wu's quantum mechanism will break through the Maskin's sufficiency theorem completely.

Suggested Citation

  • Wu, Haoyang, 2010. "A classical algorithm to break through Maskin's theorem for small-scale cases," MPRA Paper 22402, University Library of Munich, Germany.
  • Handle: RePEc:pra:mprapa:22402
    as

    Download full text from publisher

    File URL: https://mpra.ub.uni-muenchen.de/22402/1/MPRA_paper_22402.pdf
    File Function: original version
    Download Restriction: no
    ---><---

    More about this item

    Keywords

    Quantum games; Prisoners' Dilemma; Mechanism design.;
    All these keywords.

    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

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:pra:mprapa:22402. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Joachim Winter (email available below). General contact details of provider: https://edirc.repec.org/data/vfmunde.html .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.