Multiperson Bargaining and Strategic Complexity
AbstractWe investigate the effect of introducing costs of complexity in the a justification for stationary equilibrium strategies in the class of games where complexity costs matter. As is well-known, in this game every individually rational allocation is sustainable as a Nash equilibrium (also as a subgame perfect equilibrium if players are sufficiently patient and if n>2). Moreover, delays in agreement are also possible in such equilibria. By limiting ourselves to strategies that can be implemented by a machine (automaton) and by suitably modifying the definition of complexity for the purpose of analysing a single extensive form, we find that complexity costs do not reduce the range of possible allocations but they do limit the amount of delay that can occur in any agreement. In particular, we show that in any n-player game, for any allocation z, an agreement on z at any time period t can be sustained as a Nash equilibrium of the machine game with complexity costs if and only if in equilibrium, the machines implement stationary strategies. Finally, we also show that "noisy Nash equilibrium" with complexity costs sustain only the unique stationary subgame perfect equilibrium allocation.
Download InfoTo our knowledge, this item is not available for download. To find whether it is available, there are three options:
1. Check below under "Related research" whether another version of this item is available online.
2. Check on the provider's web page whether it is in fact available.
3. Perform a search for a similarly titled item that would be available.
Bibliographic InfoPaper provided by Centre for Research into Industry, Enterprise, Finance and the Firm in its series CRIEFF Discussion Papers with number 9808.
Date of creation: Oct 1998
Date of revision:
Contact details of provider:
Postal: School of Economics and Finance, University of St. Andrews, Fife KY16 9AL
Phone: 01334 462420
Fax: 01334 462438
Web page: http://crieff.wordpress.com/
More information through EDIRC
Complexity costs; agreement delay; automata; noisy Nash equilibrium;
Other versions of this item:
- C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games
- C78 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Bargaining Theory; Matching Theory
You can help add them by filling out this form.
CitEc Project, subscribe to its RSS feed for this item.
This item has more than 25 citations. To prevent cluttering this page, these citations are listed on a separate page. reading list or among the top items on IDEAS.Access and download statisticsgeneral 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: (Bram Boskamp).
If references are entirely missing, you can add them using this form.