An Evolutionary Bargaining Model
Murali Agastya
Game Theory and Information from University Library of Munich, Germany
Abstract:
Varying quantities of a single good can be produced using at least two and at most $n$ factors of production. The problem of allocating the surplus among the factors is studied in a dynamic model with adaptive behavior. Representatives for the factors (called players) make wage demands based on precedent and ignorant of each other's utilities for this good. Necessary and sufficient conditions are provided under which the long-run equilibria coincide with the core allocations. A global convergence result is proved to show that players do learn to reach a core allocation in the long run. Moreover, allowing for the possibility of mistakes by the players, all the {\em stochastically stable outcomes} are characterized. The main result shows that in the limit, these stable allocations for a particular set of players converges to the allocation that maximizes the product of all the players' utilities over all core allocations.
JEL-codes: C7 D8 (search for similar items in EconPapers)
Date: 1995-03-09
Note: LaTeX ascii file. Latex it twice to get cross references right.
References: View references in EconPapers View complete reference list from CitEc
Citations: View citations in EconPapers (2)
Downloads: (external link)
https://econwpa.ub.uni-muenchen.de/econ-wp/game/papers/9503/9503001.pdf (application/pdf)
https://econwpa.ub.uni-muenchen.de/econ-wp/game/papers/9503/9503001.tex (application/x-tex)
https://econwpa.ub.uni-muenchen.de/econ-wp/game/papers/9503/9503001.ps.gz (application/postscript)
Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.
Export reference: BibTeX
RIS (EndNote, ProCite, RefMan)
HTML/Text
Persistent link: https://EconPapers.repec.org/RePEc:wpa:wuwpga:9503001
Access Statistics for this paper
More papers in Game Theory and Information from University Library of Munich, Germany
Bibliographic data for series maintained by EconWPA ( this e-mail address is bad, please contact ).