Abstract
Bargaining, as an instance of sequential games, is a widely studied problem in game theory, experimental and computational economics. We consider the problem of evolving computational agents with optimal (Subgame Perfect Equilibrium) strategies for the Alternating Offers Bargaining Game. Previous work co-evolving agents for this problem has argued that it is not possible to achieve optimal agents at the end of the co-evolutionary process due to the myopic properties of the evolutionary agents. Emphasising the notion of a co-evolutionary solution concept, we show that this conclusion is mis-leading and present a co-evolutionary algorithm that evolves optimal strategies for the bargaining game with one round. We conclude by explaining why, using previous evaluation procedures and strategy representations, the algorithm is not able to converge to optimal strategies for games with more rounds.
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Beyer, H.: The theory of evolution strategies. Springer, New York (2001)
van Bragt, D.D.B., Gerding, E.H., La Poutré, J.A.: Equilibrium selection in alternating-offers bargaining models - the evolutionary computing approach. The Electronic Journal of Evolutionary Modeling and Economic Dynamics (2002)
Chong, S.Y., Tino, P., Yao, X.: Measuring generalization performance in coevolutionary learning. IEEE Transactions on Evolutionary Computation 12(4), 479–505 (2008)
Darwen, P.J.: Co-evolutionary learning by automatic modularisation with speciation. Ph.D. thesis, University of New South Wales (1996)
Ficici, S.G.: Solution concepts in coevolutionary algorithms. Ph.D. thesis, Brandeis University (2004)
Gerding, E., van Bragt, D.D.B., La Poutré, J.A.: Multi-issue negotiation processes by evolutionary simulation: validation and social extensions. Tech. Rep. SEN-R0024, CWI, Amsterdam, The Netherlands (2000)
Gerding, E., van Bragt, D.D.B., La Poutré, J.A.: Multi-issue negotiation processes by evolutionary simulation, validation and social extensions. Computational Economics 22(1), 39–63 (2003)
Jin, N.: Constraint-based co-evolutionary genetic programming for bargaining problems. Ph.D. thesis, University of Essex (2007)
Roth, A.: The economist as engineer: game theory, experimentation, and computation as tools for design economics. Econometrica 70(4), 1341–1378 (2002)
Rubinstein, A.: Perfect equilibrium in a bargaining model. Econometrica 50(1), 97–109 (1982)
Selten, R.: Re-examination of the perfectness concept for finite points in extensive games. International Journal of Game Theory 4, 25–55 (1975)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2010 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Chandra, A., Oliveto, P.S., Yao, X. (2010). Co-evolution of Optimal Agents for the Alternating Offers Bargaining Game. In: Di Chio, C., et al. Applications of Evolutionary Computation. EvoApplications 2010. Lecture Notes in Computer Science, vol 6024. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-12239-2_7
Download citation
DOI: https://doi.org/10.1007/978-3-642-12239-2_7
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-12238-5
Online ISBN: 978-3-642-12239-2
eBook Packages: Computer ScienceComputer Science (R0)