IDEAS home Printed from https://ideas.repec.org/a/wut/journl/v1y2014p71-96id1074.html
   My bibliography  Save this article

Probabilities on streams and reflexive games

Author

Listed:
  • Andrew Schumann

Abstract

Probability measures on streams (e.g. on hypernumbers and p-adic numbers) have been defined. It was shown that these probabilities can be used for simulations of reflexive games. In particular, it can be proved that Aumann’s agreement theorem does not hold for these probabilities. Instead of this theorem, there is a statement that is called the reflexion disagreement theorem. Based on this theorem, probabilistic and knowledge conditions can be defined for reflexive games at various reflexion levels up to the infinite level.

Suggested Citation

  • Andrew Schumann, 2014. "Probabilities on streams and reflexive games," Operations Research and Decisions, Wroclaw University of Science and Technology, Faculty of Management, vol. 24(1), pages 71-96.
    • Handle: RePEc:wut:journl:v:1:y:2014:p:71-96:id:1074
    DOI: 10.5277/ord140105
    as

    Download full text from publisher

    File URL: https://ord.pwr.edu.pl/assets/papers_archive/1074%20-%20published.pdf
    Download Restriction: no
    File URL: https://libkey.io/10.5277/ord140105?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
    ---><---

    References listed on IDEAS

    as
    1. Pierre Lescanne & Matthieu Perrinel, 2012. "''Backward'' Coinduction, Nash equilibrium and the Rationality of Escalation," Post-Print ensl-00692767, HAL.
    2. Heifetz, Aviad, 1996. "Non-well-founded-Type Spaces," Games and Economic Behavior, Elsevier, vol. 16(2), pages 202-217, October.
    3. Mailath, George J. & Samuelson, Larry, 2006. "Repeated Games and Reputations: Long-Run Relationships," OUP Catalogue, Oxford University Press, number 9780195300796.
    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. Juan‐Pablo Montero & Juan Ignacio Guzman, 2010. "Output‐Expanding Collusion In The Presence Of A Competitive Fringe," Journal of Industrial Economics, Wiley Blackwell, vol. 58(1), pages 106-126, March.
    2. Tobias Salz & Emanuel Vespa, 2020. "Estimating dynamic games of oligopolistic competition: an experimental investigation," RAND Journal of Economics, RAND Corporation, vol. 51(2), pages 447-469, June.
    3. Daron Acemoglu & Matthew O. Jackson, 2017. "Social Norms and the Enforcement of Laws," Journal of the European Economic Association, European Economic Association, vol. 15(2), pages 245-295.
    4. Kimmo Berg & Gijs Schoenmakers, 2017. "Construction of Subgame-Perfect Mixed-Strategy Equilibria in Repeated Games," Games, MDPI, vol. 8(4), pages 1-14, November.
    5. , & ,, 2015. "A folk theorem for stochastic games with infrequent state changes," Theoretical Economics, Econometric Society, vol. 10(1), January.
    6. Ernesto Dal Bó & Pedro Dal Bó & Rafael Di Tella, 2007. "Reputation When Threats and Transfers Are Available," Journal of Economics & Management Strategy, Wiley Blackwell, vol. 16(3), pages 577-598, September.
    7. Carmona, Guilherme & Carvalho, Luís, 2016. "Repeated two-person zero-sum games with unequal discounting and private monitoring," Journal of Mathematical Economics, Elsevier, vol. 63(C), pages 131-138.
    8. Bramoullé, Yann & Goyal, Sanjeev, 2016. "Favoritism," Journal of Development Economics, Elsevier, vol. 122(C), pages 16-27.
    9. Sander Heinsalu, 2018. "Corrigendum to "Managerial Incentive Problems: A Dynamic Perspective"," Papers 1811.00455, arXiv.org, revised Nov 2018.
    10. Nicolas Vieille, 2010. "Recursive Methods in Discounted Stochastic Games: An Algorithm for - 1 and a Folk Theorem," Post-Print hal-00543616, HAL.
    11. Christian Hilbe & Moshe Hoffman & Martin A. Nowak, 2015. "Cooperate without Looking in a Non-Repeated Game," Games, MDPI, vol. 6(4), pages 1-15, September.
    12. Strobl, Günter, 2022. "A theory of procyclical market liquidity," Journal of Economic Dynamics and Control, Elsevier, vol. 138(C).
    13. Larionov, Daniil, 2023. "Full surplus extraction from colluding bidders," ZEW Discussion Papers 23-029, ZEW - Leibniz Centre for European Economic Research.
    14. Loukas Dimitriou & Theodore Tsekeris, 2009. "Evolutionary game-theoretic model for dynamic congestion pricing in multi-class traffic networks," Netnomics, Springer, vol. 10(1), pages 103-121, April.
    15. , H. & ,, 2016. "Approximate efficiency in repeated games with side-payments and correlated signals," Theoretical Economics, Econometric Society, vol. 11(1), January.
    16. Matsushima Hitoshi, 2020. "Behavioral Theory of Repeated Prisoner’s Dilemma: Generous Tit-For-Tat Strategy," The B.E. Journal of Theoretical Economics, De Gruyter, vol. 20(1), pages 1-11, January.
    17. Alcalde, Pilar & Vial, Bernardita, 2016. "Willingness to Pay for Firm Reputation: Paying for Risk Rating in the Annuity Market," MPRA Paper 68993, University Library of Munich, Germany.
    18. Joel Shapiro & Jing Zeng, 2024. "Stress Testing and Bank Lending," The Review of Financial Studies, Society for Financial Studies, vol. 37(4), pages 1265-1314.
    19. Ekmekci, Mehmet & Gossner, Olivier & Wilson, Andrea, 2012. "Impermanent types and permanent reputations," Journal of Economic Theory, Elsevier, vol. 147(1), pages 162-178.
    20. Luca Anderlini & Dino Gerardi & Roger Lagunoff, 2012. "Communication and Learning," The Review of Economic Studies, Review of Economic Studies Ltd, vol. 79(2), pages 419-450.

    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:wut:journl:v:1:y:2014:p:71-96:id:1074. 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: Adam Kasperski (email available below). General contact details of provider: https://edirc.repec.org/data/iopwrpl.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.