A Trade Network Game with Endogenous Partner Selection
This paper develops an evolutionary trade network game (TNG) that combines evolutionary game play with endogenous partner selection. Successive generations of resource-constrained buyers and sellers choose and refuse trade partners on the basis of continually updated expected payoffs. Trade partner selection takes place in accordance with a modified Gale-Shapley matching mechanism, and trades are implemented using trade strategies evolved via a standardly specified genetic algorithm. The trade partnerships resulting from the matching mechanism are shown to be core stable and Pareto optimal in each successive trade cycle. Nevertheless, computer experiments suggest that these static optimality properties may be inadequate measures of optimality from an evolutionary perspective. Related work can be accessed at: http://www2.econ.iastate.edu/tesfatsi/tnghome.htm
|Date of creation:||01 Jan 1997|
|Date of revision:|
|Contact details of provider:|| Postal: Iowa State University, Dept. of Economics, 260 Heady Hall, Ames, IA 50011-1070|
Phone: +1 515.294.6741
Fax: +1 515.294.0221
Web page: http://www.econ.iastate.edu
More information through EDIRC
Please report citation or reference errors to , or , if you are the registered author of the cited work, log in to your RePEc Author Service profile, click on "citations" and make appropriate adjustments.:
- Stanley, E.A. & Ashlock, Daniel & Tesfatsion, Leigh, 1994. "Iterated Prisoner's Dilemma with Choice and Refusal of Partners," Staff General Research Papers 11180, Iowa State University, Department of Economics.
- David MCFADZEAN & Leigh TESFATSION, 1996.
"A C++ Platform For The Evolution Of Trade Networks,"
39, Iowa State University Department of Economics.
- McFadzean, David & Tesfatsion, Leigh, 1999. "A C++ Platform for the Evolution of Trade Networks," Computational Economics, Society for Computational Economics, vol. 14(1-2), pages 109-34, October.
- McFadzean, David & Tesfatsion, Leigh S., 1999. "A C++ Platform for the Evolution of Trade Networks," Staff General Research Papers 1639, Iowa State University, Department of Economics.
- Brock,W.A. & Durlauf,S.N., 2000.
"Discrete choice with social interactions,"
7, Wisconsin Madison - Social Systems.
- Esther Hauk, .
"Leaving the Prison: A Discussion of the Iterated Prisoner's Dilemma under Preferential Partner Selection,"
Computing in Economics and Finance 1996
_067, Society for Computational Economics.
- Hauk, Esther, 1997. "Leaving the prison: A discussion of the Iterated prisoner`s dilemma under preferential partner selection," UC3M Working papers. Economics 6056, Universidad Carlos III de Madrid. Departamento de Economía.
- Hirshlifer, David & Rassmusen, Eric, 1989. "Cooperation in a repeated prisoners' dilemma with ostracism," Journal of Economic Behavior & Organization, Elsevier, vol. 12(1), pages 87-106, August.
- Yannis M. Ioannides, 1996. "Evolution of Trading Structures," Working Papers 96-04-020, Santa Fe Institute.
- Ashlock, Daniel & Smucker, Mark D. & Stanley, E. Ann & Tesfatsion, Leigh S., 1996.
"Preferential Partner Selection in an Evolutionary Study of Prisoner's Dilemma,"
Staff General Research Papers
1687, Iowa State University, Department of Economics.
- Dan Ashlock & Mark D. Smucker & E. Ann Stanley & Leigh Tesfatsion, 1995. "Preferential Partner Selection in an Evolutionary Study of Prisoner's Dilemma," Game Theory and Information 9501002, EconWPA, revised 20 Jan 1995.
- Alan P. Kirman, 1995.
"Economies with Interacting Agents,"
Discussion Paper Serie A
500, University of Bonn, Germany.
- Mailath, G.J. & Samuelson, L. & Shaked, A., 1994.
"Evolution and Endogenous Interations,"
9426, Wisconsin Madison - Social Systems.
When requesting a correction, please mention this item's handle: RePEc:isu:genres:1680. 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: (Curtis Balmer)
If references are entirely missing, you can add them using this form.