IDEAS home Printed from https://ideas.repec.org/a/spr/jogath/v53y2024i2d10.1007_s00182-024-00892-5.html

Finitely additive behavioral strategies: when do they induce an unambiguous expected payoff?

Author

Listed:
  • János Flesch

    (Maastricht University)

  • Dries Vermeulen

    (Maastricht University)

  • Anna Zseleva

    (Maastricht University)

Abstract

We examine infinite horizon decision problems with arbitrary bounded payoff functions in which the decision maker uses finitely additive behavioral strategies. Since we only assume that the payoff function is bounded, it is well-known that these behavioral strategies generally do not induce unambiguously defined expected payoffs. Consequently, it is not clear how to compare behavioral strategies and define optimality. We address this problem by finding conditions on the payoff function that guarantee an unambiguous expected payoff regardless of which behavioral strategy the decision maker uses. To this end, we systematically consider various alternatives proposed in the literature on how to define the finitely additive probability measure on the set of infinite plays induced by a behavioral strategy.

Suggested Citation

  • János Flesch & Dries Vermeulen & Anna Zseleva, 2024. "Finitely additive behavioral strategies: when do they induce an unambiguous expected payoff?," International Journal of Game Theory, Springer;Game Theory Society, vol. 53(2), pages 695-723, June.
  • Handle: RePEc:spr:jogath:v:53:y:2024:i:2:d:10.1007_s00182-024-00892-5
    DOI: 10.1007/s00182-024-00892-5
    as

    Download full text from publisher

    File URL: http://link.springer.com/10.1007/s00182-024-00892-5
    File Function: Abstract
    Download Restriction: Access to the full text of the articles in this series is restricted.

    File URL: https://libkey.io/10.1007/s00182-024-00892-5?utm_source=ideas
    LibKey link: if access is restricted and if your library uses this service, LibKey will redirect you to where you can use your library subscription to access this item
    ---><---

    As the access to this document is restricted, you may want to

    for a different version of it.

    References listed on IDEAS

    as
    1. Flesch, János & Vermeulen, Dries & Zseleva, Anna, 2017. "Zero-sum games with charges," Games and Economic Behavior, Elsevier, vol. 102(C), pages 666-686.
    2. A. Maitra & W. Sudderth, 1998. "Finitely additive stochastic games with Borel measurable payoffs," International Journal of Game Theory, Springer;Game Theory Society, vol. 27(2), pages 257-267.
    3. Nabil I. Al-Najjar, 2009. "Decision Makers as Statisticians: Diversity, Ambiguity, and Learning," Econometrica, Econometric Society, vol. 77(5), pages 1371-1401, September.
    4. William D. Sudderth, 2016. "Finitely Additive Dynamic Programming," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 92-108, February.
    5. Capraro, Valerio & Scarsini, Marco, 2013. "Existence of equilibria in countable games: An algebraic approach," Games and Economic Behavior, Elsevier, vol. 79(C), pages 163-180.
    6. Oliver Schirokauer & Joseph B. Kadane, 2007. "Uniform Distributions on the Natural Numbers," Journal of Theoretical Probability, Springer, vol. 20(3), pages 429-441, September.
    7. Cerreia-Vioglio, Simone & Maccheroni, Fabio & Schmeidler, David, 2022. "Equilibria of nonatomic anonymous games," Games and Economic Behavior, Elsevier, vol. 135(C), pages 110-131.
    8. Harris, Christopher J. & Stinchcombe, Maxwell B. & Zame, William R., 2005. "Nearly compact and continuous normal form games: characterizations and equilibrium existence," Games and Economic Behavior, Elsevier, vol. 50(2), pages 208-224, February.
    9. Maitra, A & Sudderth, W, 1993. "Finitely Additive and Measurable Stochastic Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 22(3), pages 201-223.
    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. János Flesch & Dries Vermeulen & Anna Zseleva, 2019. "Catch games: the impact of modeling decisions," International Journal of Game Theory, Springer;Game Theory Society, vol. 48(2), pages 513-541, June.
    2. Flesch, János & Vermeulen, Dries & Zseleva, Anna, 2017. "Zero-sum games with charges," Games and Economic Behavior, Elsevier, vol. 102(C), pages 666-686.
    3. János Flesch & Dries Vermeulen & Anna Zseleva, 2021. "Legitimate equilibrium," International Journal of Game Theory, Springer;Game Theory Society, vol. 50(4), pages 787-800, December.
    4. Flesch, Janos & Vermeulen, Dries & Zseleva, Anna, 2018. "Existence of justifiable equilibrium," Research Memorandum 016, Maastricht University, Graduate School of Business and Economics (GSBE).
    5. Capraro, Valerio & Scarsini, Marco, 2013. "Existence of equilibria in countable games: An algebraic approach," Games and Economic Behavior, Elsevier, vol. 79(C), pages 163-180.
    6. Hugo Gimbert & Jérôme Renault & Sylvain Sorin & Xavier Venel & Wieslaw Zielonka, 2016. "On the values of repeated games with signals," PSE-Ecole d'économie de Paris (Postprint) hal-01006951, HAL.
    7. William D. Sudderth, 2016. "Finitely Additive Dynamic Programming," Mathematics of Operations Research, INFORMS, vol. 41(1), pages 92-108, February.
    8. Shravan Luckraz & Nan-Jing Huang, 2022. "On a Fixed Point Theorem for General Multivalued Mappings on Finite Sets with Applications in Game Theory," Journal of Mathematics, Hindawi, vol. 2022, pages 1-9, June.
    9. William D. Sudderth, 2020. "Optimal markov strategies," Decisions in Economics and Finance, Springer;Associazione per la Matematica, vol. 43(1), pages 43-54, June.
    10. Montiel Olea, José Luis & Nesbit, James, 2021. "(Machine) learning parameter regions," Journal of Econometrics, Elsevier, vol. 222(1), pages 716-744.
    11. János Flesch & P. Jean-Jacques Herings & Jasmine Maes & Arkadi Predtetchinski, 2021. "Subgame Maxmin Strategies in Zero-Sum Stochastic Games with Tolerance Levels," Dynamic Games and Applications, Springer, vol. 11(4), pages 704-737, December.
    12. Ryoichi Kunisada, 2022. "On the Additive Property of Finitely Additive Measures," Journal of Theoretical Probability, Springer, vol. 35(3), pages 1782-1794, September.
    13. Laraki, Rida & Sorin, Sylvain, 2015. "Advances in Zero-Sum Dynamic Games," Handbook of Game Theory with Economic Applications,, Elsevier.
    14. Stinchcombe, Maxwell B., 2016. "Objective and subjective foundations for multiple priors," Journal of Economic Theory, Elsevier, vol. 165(C), pages 263-291.
    15. Martin, Ian W.R. & Nagel, Stefan, 2022. "Market efficiency in the age of big data," Journal of Financial Economics, Elsevier, vol. 145(1), pages 154-177.
    16. Joseph Abdou & Nikolaos Pnevmatikos & Marco Scarsini, 2014. "Uniformity and games decomposition," Documents de travail du Centre d'Economie de la Sorbonne 14084r, Université Panthéon-Sorbonne (Paris 1), Centre d'Economie de la Sorbonne, revised Mar 2017.
    17. Esponda, Ignacio & Pouzo, Demian, 2021. "Equilibrium in misspecified Markov decision processes," Theoretical Economics, Econometric Society, vol. 16(2), May.
    18. Julio González-Díaz & Miguel Meléndez-Jiménez, 2014. "On the notion of perfect Bayesian equilibrium," TOP: An Official Journal of the Spanish Society of Statistics and Operations Research, Springer;Sociedad de Estadística e Investigación Operativa, vol. 22(1), pages 128-143, April.
    19. Pai, Mallesh & Hansen, Karsten, 2020. "Algorithmic Collusion: Supra-competitive Prices via Independent Algorithms," CEPR Discussion Papers 14372, Centre for Economic Policy Research.
    20. Barelli, Paulo & Duggan, John, 2014. "A note on semi-Markov perfect equilibria in discounted stochastic games," Journal of Economic Theory, Elsevier, vol. 151(C), pages 596-604.

    More about this item

    Keywords

    ;
    ;
    ;
    ;

    JEL classification:

    • C72 - Mathematical and Quantitative Methods - - Game Theory and Bargaining Theory - - - Noncooperative Games

    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:spr:jogath:v:53:y:2024:i:2:d:10.1007_s00182-024-00892-5. 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: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    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.