Advanced Search
MyIDEAS: Login

Nash implementation with little communication


Author Info

  • Segal, Ilya R.

    (Department of Economics, Stanford University)

Registered author(s):


    The paper considers the communication complexity (measured in bits or real numbers) of Nash implementation of social choice rules. A key distinction is whether we restrict to the traditional one-stage mechanisms or allow multi-stage mechanisms. For one-stage mechanisms, the paper shows that for a large and important subclass of monotonic choice rules -- called "intersection monotonic" -- the total message space size needed for one-stage Nash implementation is essentially the same as that needed for "verification" (with honest agents who are privately informed about their preferences). According to Segal (2007), the latter is the size of the space of minimally informative budget equilibria verifying the choice rule. However, multi-stage mechanisms allow a drastic reduction in communication complexity. Namely, for an important subclass of intersection-monotonic choice rules (which includes rules based on coalitional blocking such as exact or approximate Pareto efficiency, stability, and envy-free allocations) we propose a two-stage Nash implementation mechanism in which each agent announces no more than two alternatives plus one bit per agent in any play. Such two-stage mechanisms bring about an exponential reduction in the communication complexity of Nash implementation for discrete communication measured in bits, or a reduction from infinite- to low-dimensional continuous communication.

    Download Info

    If 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.
    File URL:
    Download Restriction: no

    Bibliographic Info

    Article provided by Econometric Society in its journal Theoretical Economics.

    Volume (Year): 5 (2010)
    Issue (Month): 1 (January)

    as in new window
    Handle: RePEc:the:publsh:576

    Contact details of provider:
    Web page:

    Related research

    Keywords: Monotonic social choice rules; Nash implementation; communication complexity; verification; realization; budget sets; price equilibria;

    Find related papers by JEL classification:


    No references listed on IDEAS
    You can help add them by filling out this form.


    Citations are extracted by the CitEc Project, subscribe to its RSS feed for this item.
    as in new window

    Cited by:
    1. Babaioff, Moshe & Blumrosen, Liad & Schapira, Michael, 2013. "The communication burden of payment determination," Games and Economic Behavior, Elsevier, vol. 77(1), pages 153-167.


    This item is not listed on Wikipedia, on a reading list or among the top items on IDEAS.


    Access and download statistics


    When requesting a correction, please mention this item's handle: RePEc:the:publsh:576. 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: (Martin J. Osborne).

    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.

    If references are entirely missing, you can add them using this form.

    If the full references list an item that is present in RePEc, but the system did not link to it, you can help with 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 profile, as there may be some citations waiting for confirmation.

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