IDEAS home Printed from https://ideas.repec.org/p/wop/safiwp/99-08-057.html
   My bibliography  Save this paper

I Can't Think With All This Noise: Inferring Strategies Using Symbolic Regression

Author

Listed:
  • Jim Warnick

Abstract

We use symbolic regression (implemented by a genetic program) to analyze the role of agent expectation formation in games. In the model, agents attempt to infer the strategies of opponents through regression and then best respond using this information. Though agents use deterministic strategies, behavior that resembles a mixed strategy emerges. When one agent uses more complicated strategy primitives (building blocks) significant performance advantages are realized. However, even small amounts of noise in the system can eliminate this advantage. By changing the design of the game we show that it is crucial to accurately infer past actions in order to realize performance advantages from complexity.

Suggested Citation

  • Jim Warnick, 1999. "I Can't Think With All This Noise: Inferring Strategies Using Symbolic Regression," Working Papers 99-08-057, Santa Fe Institute.
    • Handle: RePEc:wop:safiwp:99-08-057
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below 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.

    References listed on IDEAS

    as
    1. Abreu, Dilip & Rubinstein, Ariel, 1988. "The Structure of Nash Equilibrium in Repeated Games with Finite Automata," Econometrica, Econometric Society, vol. 56(6), pages 1259-1281, November.
    2. John Duffy & Jim Warnick, 1999. "Using Symbolic Regression to Infer Strategies from Experimental Data," Computing in Economics and Finance 1999 1033, Society for Computational Economics.
    3. Miller, John H., 1996. "The coevolution of automata in the repeated Prisoner's Dilemma," Journal of Economic Behavior & Organization, Elsevier, vol. 29(1), pages 87-112, January.
    Full references (including those not matched with items on IDEAS)

    Most related items

    These are the items that most often cite the same works as this one and are cited by the same works as this one.
    1. Olivier Compte & Andrew Postlewaite, 2007. "Effecting Cooperation," PIER Working Paper Archive 09-019, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 29 May 2009.
    2. García, Julián & van Veelen, Matthijs, 2016. "In and out of equilibrium I: Evolution of strategies in repeated games with discounting," Journal of Economic Theory, Elsevier, vol. 161(C), pages 161-189.
    3. Zhang, Huanren, 2018. "Errors can increase cooperation in finite populations," Games and Economic Behavior, Elsevier, vol. 107(C), pages 203-219.
    4. Andrew Postlewaite & Olivier Compte, 2008. "Repeated Relationships with Limits on Information Processing," PIER Working Paper Archive 08-026, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    5. Duffy, John & Ünver, M.Utku, 2008. "Internet auctions with artificial adaptive agents: A study on market design," Journal of Economic Behavior & Organization, Elsevier, vol. 67(2), pages 394-417, August.
    6. Christos Ioannou, 2014. "Coevolution of finite automata with errors," Journal of Evolutionary Economics, Springer, vol. 24(3), pages 541-571, July.
    7. Evans, Alecia & Sesmero, Juan, 2022. "Cooperation in Social Dilemmas with Correlated Noisy Payoffs: Theory and Experimental Evidence," 2021 Annual Meeting, August 1-3, Austin, Texas 322804, Agricultural and Applied Economics Association.
    8. David Baron & Ehud Kalai, 1990. "Dividing a Cake by Majority: The Simplest Equilibria," Discussion Papers 919, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    9. Rudolf Vetschera, 2003. "Experimentation and Learning in Repeated Cooperation," Computational and Mathematical Organization Theory, Springer, vol. 9(1), pages 37-60, May.
    10. Tracy Xiao Liu & Jenna Bednar & Yan Chen & Scott Page, 2019. "Directional behavioral spillover and cognitive load effects in multiple repeated games," Experimental Economics, Springer;Economic Science Association, vol. 22(3), pages 705-734, September.
    11. Jean-Luc Gaffard & Mauro Napoletano, 2012. "Agent-based models and economic policy," Post-Print hal-03461120, HAL.
    12. Samahita, Margaret & Holm, Håkan J., 2020. "Mining for Mood Effect in the Field," Working Papers 2020:2, Lund University, Department of Economics.
    13. Jehiel, Philippe, 1998. "Learning to Play Limited Forecast Equilibria," Games and Economic Behavior, Elsevier, vol. 22(2), pages 274-298, February.
    14. Prajit K. Dutta & Paolo Siconolfi, 2010. "Mixed strategy equilibria in repeated games with one‐period memory," International Journal of Economic Theory, The International Society for Economic Theory, vol. 6(1), pages 167-187, March.
    15. Samuelson, Larry & Swinkels, Jeroen M., 2003. "Evolutionary stability and lexicographic preferences," Games and Economic Behavior, Elsevier, vol. 44(2), pages 332-342, August.
    16. Beenstock, Michael & Szpiro, George, 2002. "Specification search in nonlinear time-series models using the genetic algorithm," Journal of Economic Dynamics and Control, Elsevier, vol. 26(5), pages 811-835, May.
    17. Van Damme, Eric, 1994. "Evolutionary game theory," European Economic Review, Elsevier, vol. 38(3-4), pages 847-858, April.
    18. Rubinstein, A. & Wolnsky, A., 1992. "A Rermark on Infinitely Repeated Extensive Games," Papers 4-92, Tel Aviv - the Sackler Institute of Economic Studies.
    19. van Damme, E.E.C., 1995. "Game theory : The next stage," Discussion Paper 1995-73, Tilburg University, Center for Economic Research.
    20. Barr, Jason & Saraceno, Francesco, 2009. "Organization, learning and cooperation," Journal of Economic Behavior & Organization, Elsevier, vol. 70(1-2), pages 39-53, May.

    More about this item

    Keywords

    Genetic program; symbolic regression;

    NEP fields

    This paper has been announced in the following NEP Reports:

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:wop:safiwp:99-08-057. See general information about how to correct material in RePEc.

    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 CitEc recognized a bibliographic reference but did not link an item in RePEc 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 RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Thomas Krichel (email available below). General contact details of provider: https://edirc.repec.org/data/epstfus.html .

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

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.