IDEAS home Printed from https://ideas.repec.org/f/pst204.html
   My authors  Follow this author

William George Stanford

Personal Details

First Name:William
Middle Name:George
Last Name:Stanford
Suffix:
RePEc Short-ID:pst204
[This author has chosen not to make the email address public]

Affiliation

Department of Economics
University of Illinois at Chicago

Chicago, Illinois (United States)
http://www.uic.edu/depts/econ/
RePEc:edi:deuicus (more details at EDIRC)

Research output

as
Jump to: Working papers Articles

Working papers

  1. Ehud Kalai & William Stanford, 1986. "Finite Rationality and Interpersonal Complexity in Repeated Games," Discussion Papers 679, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  2. Ehud Kalai & William Stanford, 1983. "Conjectural Variations Strategies in Dynamic Cournot Games With Fast Reactions," Discussion Papers 575, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
  3. Ehud Kalai & William Stanford, 1982. "Duopoly, Conjectural Variations and Supergames," Discussion Papers 525, Northwestern University, Center for Mathematical Studies in Economics and Management Science.

Articles

  1. Stanford, William, 2011. "A family of identities related to zero-sum and team games," Mathematical Social Sciences, Elsevier, vol. 62(2), pages 91-94, September.
  2. Stanford, William, 2010. "The number of pure strategy Nash equilibria in random multi-team games," Economics Letters, Elsevier, vol. 108(3), pages 352-354, September.
  3. Stanford, William, 2004. "Improvement paths in repeated pure coordination games," Economics Letters, Elsevier, vol. 85(3), pages 341-345, December.
  4. Stanford, William, 2004. "Individually rational pure strategies in large games," Games and Economic Behavior, Elsevier, vol. 47(1), pages 221-233, April.
  5. Stanford, William, 2000. "On comparing equilibrium and optimum payoffs in a class of discrete bimatrix games," Mathematical Social Sciences, Elsevier, vol. 39(1), pages 13-20, January.
  6. Stanford, William, 1999. "On the number of pure strategy Nash equilibria in finite common payoffs games," Economics Letters, Elsevier, vol. 62(1), pages 29-34, January.
  7. Stanford, William, 1997. "On the distribution of pure strategy equilibria in finite games with vector payoffs," Mathematical Social Sciences, Elsevier, vol. 33(2), pages 115-127, April.
  8. Stanford, William, 1991. "Prestable strategies in discounted duopoly games," Games and Economic Behavior, Elsevier, vol. 3(1), pages 129-144, February.
  9. Stanford, William, 1989. "Symmetric paths and evolution to equilibrium in the discounted prisoners' dilemma," Economics Letters, Elsevier, vol. 31(2), pages 139-143, December.
  10. Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March.
  11. Kalai, Ehud & Samet, Dov & Stanford, William, 1988. "A Note on Reactive Equilibria in the Discounted Prisoner's Dilemma and Associated Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 17(3), pages 177-186.
  12. Stanford, William G., 1986. "Subgame perfect reaction function equilibria in discounted duopoly supergames are trivial," Journal of Economic Theory, Elsevier, vol. 39(1), pages 226-232, June.
  13. Stanford, William G., 1986. "On continuous reaction function equilibria in duopoly supergames with mean payoffs," Journal of Economic Theory, Elsevier, vol. 39(1), pages 233-250, June.
  14. Kalai, Ehud & Stanford, William, 1985. "Conjectural variations strategies in accelerated cournot games," International Journal of Industrial Organization, Elsevier, vol. 3(2), pages 133-152, June.
    RePEc:inm:ormoor:v:21:y:1996:i:3:p:726-733 is not listed on IDEAS

Citations

Many of the citations below have been collected in an experimental project, CitEc, where a more detailed citation analysis can be found. These are citations from works listed in RePEc that could be analyzed mechanically. So far, only a minority of all works could be analyzed. See under "Corrections" how you can help improve the citation analysis.

Working papers

  1. Ehud Kalai & William Stanford, 1986. "Finite Rationality and Interpersonal Complexity in Repeated Games," Discussion Papers 679, Northwestern University, Center for Mathematical Studies in Economics and Management Science.

    Cited by:

    1. Norman, Thomas W.L., 2022. "The possibility of Bayesian learning in repeated games," Games and Economic Behavior, Elsevier, vol. 136(C), pages 142-152.
    2. Barlo, Mehmet & Carmona, Guilherme & Sabourian, Hamid, 2016. "Bounded memory Folk Theorem," Journal of Economic Theory, Elsevier, vol. 163(C), pages 728-774.
    3. Barlo, Mehmet & Urgun, Can, 2011. "Stochastic discounting in repeated games: Awaiting the almost inevitable," MPRA Paper 28537, University Library of Munich, Germany.
    4. Sylvain Béal, 2010. "Perceptron versus Automaton in the Finitely Repeated Prisoner's Dilemma," Post-Print halshs-00530593, HAL.
    5. Ben-Porath, Elchanan, 1991. "Repeated Games with Finite Automata," Foerder Institute for Economic Research Working Papers 275511, Tel-Aviv University > Foerder Institute for Economic Research.
    6. Mehmet Barlo & Guilherme Carmona, 2007. "One - memory in repeated games," Nova SBE Working Paper Series wp500, Universidade Nova de Lisboa, Nova School of Business and Economics.
    7. 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.
    8. Jones, Matthew T., 2014. "Strategic complexity and cooperation: An experimental study," Journal of Economic Behavior & Organization, Elsevier, vol. 106(C), pages 352-366.
    9. Harold L. Cole & Narayana R. Kocherlakota, 2001. "Finite memory and imperfect monitoring," Staff Report 287, Federal Reserve Bank of Minneapolis.
    10. Ehud Kalai & Alejandro Neme, 1989. "The Strength of a Little Perfection," Discussion Papers 858, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    11. Lee, J. & Sabourian, H., 2004. "Complexity and Efficiency in Repeated Games and Negotiation," Cambridge Working Papers in Economics 0419, Faculty of Economics, University of Cambridge.
    12. Barlo, Mehmet & Carmona, Guilherme & Sabourian, Hamid, 2009. "Repeated games with one-memory," Journal of Economic Theory, Elsevier, vol. 144(1), pages 312-336, January.
    13. Itzhak Gilboa & David Schmeidler, 1994. "Infinite Histories and Steady Orbits in Repeated Games," Post-Print hal-00481357, HAL.
    14. Marco Scarsini & Tristan Tomala, 2012. "Repeated congestion games with bounded rationality," International Journal of Game Theory, Springer;Game Theory Society, vol. 41(3), pages 651-669, August.
    15. John H. Nachbar, 1995. "Prediction, Optimization, and Learning in Repeated Games," Game Theory and Information 9504001, University Library of Munich, Germany, revised 22 Feb 1996.
    16. Olivier Compte & Andrew Postlewaite, 2010. "Plausible Cooperation,Third Version," PIER Working Paper Archive 13-008, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 01 Dec 2012.
    17. Marco Battaglini & Stephen Coate, 2007. "A Dynamic Theory of Public Spending, Taxation and Debt," Discussion Papers 1441, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    18. Bednar, Jenna & Jones-Rooy, Andrea & Page, Scott E., 2015. "Choosing a future based on the past: Institutions, behavior, and path dependence," European Journal of Political Economy, Elsevier, vol. 40(PB), pages 312-332.
    19. V. Bhaskar & Fernando Vega-Redondo, 1998. "Asynchronous Choice and Markov Equilibria:Theoretical Foundations and Applications," Game Theory and Information 9809003, University Library of Munich, Germany.
    20. Mount, Kenneth R & Reiter, Stanley, 1996. "A Lower Bound on Computational Complexity Given by Revelation Mechanisms," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 7(2), pages 237-266, February.
    21. Hamid Sabourian & Jihong Lee, 2004. "Complexity and Efficiency in the Negotiation Game," Econometric Society 2004 North American Winter Meetings 82, Econometric Society.
    22. Lee, Jihong & Sabourian, Hamid, 2007. "Coase theorem, complexity and transaction costs," Journal of Economic Theory, Elsevier, vol. 135(1), pages 214-235, July.
    23. José E. Vila & Amparo Urbano, 1998. "- Unmediated Communication In Repeated Games With Imperfect Monitoring," Working Papers. Serie AD 1998-27, Instituto Valenciano de Investigaciones Económicas, S.A. (Ivie).
    24. Jehiel, Philippe, 1998. "Learning to Play Limited Forecast Equilibria," Games and Economic Behavior, Elsevier, vol. 22(2), pages 274-298, February.
    25. Scott E. Page, 2008. "Uncertainty, Difficulty, and Complexity," Journal of Theoretical Politics, , vol. 20(2), pages 115-149, April.
    26. Arndt Christiansen & Wolfgang Kerber, 2006. "Competition Policy With Optimally Differentiated Rules Instead Of “Per Se Rules Vs Rule Of Reason”," Journal of Competition Law and Economics, Oxford University Press, vol. 2(2), pages 215-244.
    27. Besner, Manfred, 2020. "Values for level structures with polynomial-time algorithms, relevant coalition functions, and general considerations," MPRA Paper 99355, University Library of Munich, Germany.
    28. Nicolas Querou & Sylvain Beal, 2006. "Bounded Rationality and Repeated Network Formation," Working Papers 2006.74, Fondazione Eni Enrico Mattei.
    29. Ran Spiegler, 2003. "Simplicity of Beliefs and Delay Tactics in a Concession Game," Levine's Working Paper Archive 506439000000000208, David K. Levine.
    30. Marks, Robert, 1998. "Evolved perception and behaviour in oligopolies," Journal of Economic Dynamics and Control, Elsevier, vol. 22(8-9), pages 1209-1233, August.
    31. Lee, Jihong & Sabourian, Hamid, 2015. "Complexity and repeated implementation," Journal of Economic Theory, Elsevier, vol. 158(PA), pages 259-292.
    32. Guilherme Carmona, 2006. "On the optimality of the equality matching form of sociality," Nova SBE Working Paper Series wp489, Universidade Nova de Lisboa, Nova School of Business and Economics.
    33. Eitan Zemel, 1985. "On Communication, Bounded Complexity, and Cooperation," Discussion Papers 685, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    34. Olivier Compte & Andrew Postlewaite, 2015. "Plausible cooperation," PSE-Ecole d'économie de Paris (Postprint) halshs-01204780, HAL.
    35. Bhaskar, V. & Vega-Redondo, Fernando, 2002. "Asynchronous Choice and Markov Equilibria," Journal of Economic Theory, Elsevier, vol. 103(2), pages 334-350, April.
    36. Hong, Lu & Page, Scott E., 2001. "Problem Solving by Heterogeneous Agents," Journal of Economic Theory, Elsevier, vol. 97(1), pages 123-163, March.
    37. Stracke, Rudi & Kerschbamer, Rudolf & Sunde, Uwe, 2017. "Coping with complexity – Experimental evidence for narrow bracketing in multi-stage contests," European Economic Review, Elsevier, vol. 98(C), pages 264-281.
    38. Ioannou, Christos A. & Romero, Julian, 2014. "A generalized approach to belief learning in repeated games," Games and Economic Behavior, Elsevier, vol. 87(C), pages 178-203.
    39. Wärneryd, K.E., 1993. "Communication, Complexity, and Evolutionary Stability," Discussion Paper 1993-13, Tilburg University, Center for Economic Research.
    40. Jeffrey E. Prisbrey, 1993. "A Bounded Rationality, Evolutionary Model for Behavior in Two Person Reciprocity Games," Game Theory and Information 9312003, University Library of Munich, Germany.
    41. Yuval Salant & Jörg L. Spenkuch, 2021. "Complexity and Choice," CESifo Working Paper Series 9239, CESifo.
    42. Hamid Sabourian & Jihong Lee, 2004. "Complexity and Efficiency in Repeated Games with Negotiation," Econometric Society 2004 North American Summer Meetings 58, Econometric Society.
    43. Ho, Teck-Hua, 1996. "Finite automata play repeated prisoner's dilemma with information processing costs," Journal of Economic Dynamics and Control, Elsevier, vol. 20(1-3), pages 173-207.
    44. Matthijs van Veelen & Julian Garcia, 2010. "In and Out of Equilibrium: Evolution of Strategies in Repeated Games with Discounting," Tinbergen Institute Discussion Papers 10-037/1, Tinbergen Institute.
    45. Renault, Jérôme & Scarsini, Marco & Tomala, Tristan, 2008. "Playing off-line games with bounded rationality," Mathematical Social Sciences, Elsevier, vol. 56(2), pages 207-223, September.
    46. Nachbar, John H & Zame, William R, 1996. "Non-computable Strategies and Discounted Repeated Games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(1), pages 103-122, June.
    47. Spiegler, Ran, 2005. "Testing threats in repeated games," Journal of Economic Theory, Elsevier, vol. 121(2), pages 214-235, April.
    48. René Levínský & Abraham Neyman & Miroslav Zelený, 2020. "Should I remember more than you? Best responses to factored strategies," International Journal of Game Theory, Springer;Game Theory Society, vol. 49(4), pages 1105-1124, December.
    49. Daniel Monte & Maher Said, 2014. "The value of (bounded) memory in a changing world," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 56(1), pages 59-82, May.
    50. O. Gossner & P. Hernandez, 2001. "On the complexity of coordination," THEMA Working Papers 2001-21, THEMA (THéorie Economique, Modélisation et Applications), Université de Cergy-Pontoise.
    51. Ehud Kalai, 1995. "Games," Discussion Papers 1141, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    52. Diasakos, Theodoros M, 2013. "Complexity and Bounded Rationality in Individual Decision Problemsing," SIRE Discussion Papers 2013-93, Scottish Institute for Research in Economics (SIRE).
    53. Chong Lim Kim & Yong-Gwan Kim, 1993. "The Evolution of Obedience Norms in the Repeated Carrot-and-the Stick Game," Game Theory and Information 9311001, University Library of Munich, Germany.
    54. Hannu Vartiainen, 2009. "A Simple Model of Secure Public Communication," Theory and Decision, Springer, vol. 67(1), pages 101-122, July.
    55. Monte, Daniel, 2014. "Learning with bounded memory in games," Games and Economic Behavior, Elsevier, vol. 87(C), pages 204-223.
    56. Bednar, Jenna & Chen, Yan & Liu, Tracy Xiao & Page, Scott, 2012. "Behavioral spillovers and cognitive load in multiple games: An experimental study," Games and Economic Behavior, Elsevier, vol. 74(1), pages 12-31.
    57. Binmore, Ken & Piccione, Michele & Samuelson, Larry, 1998. "Evolutionary Stability in Alternating-Offers Bargaining Games," Journal of Economic Theory, Elsevier, vol. 80(2), pages 257-291, June.
    58. Hernández, Penélope & Urbano, Amparo, 2008. "Codification schemes and finite automata," Mathematical Social Sciences, Elsevier, vol. 56(3), pages 395-409, November.
    59. Ehud Kalai, 1987. "Bounded Rationality and Strategic Complexity in Repeated Games," Discussion Papers 783, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    60. Wärneryd, K.E., 1993. "Communication, Complexity, and Evolutionary Stability," Other publications TiSEM 9fdde4d5-774a-4e67-9be1-3, Tilburg University, School of Economics and Management.
    61. Eitan Zemel, 1988. "Small Talk and Cooperation A Note on Bounded Rationality," Discussion Papers 803, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    62. Kalai, Ehud & Shmaya, Eran, 2018. "Large strategic dynamic interactions," Journal of Economic Theory, Elsevier, vol. 178(C), pages 59-81.
    63. van Veelen, Matthijs & García, Julián, 2019. "In and out of equilibrium II: Evolution in repeated games with discounting and complexity costs," Games and Economic Behavior, Elsevier, vol. 115(C), pages 113-130.
    64. Burkov, Andriy & Chaib-draa, Brahim, 2015. "Computing equilibria in discounted dynamic games," Applied Mathematics and Computation, Elsevier, vol. 269(C), pages 863-884.
    65. Oliver Compte & Andrew Postlewaite, 2010. "Plausible Cooperation, Fourth Version," PIER Working Paper Archive 15-006, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 23 Jan 2015.
    66. Mehmet Barlo & Guilherme Carmona, 2004. "Time Dependent Bounded Recall Strategies Are Enough to Play the Discounted Repeated Prisoners' Dilemma," Game Theory and Information 0405006, University Library of Munich, Germany.
    67. Masahiko Ueda, 2022. "Controlling Conditional Expectations by Zero-Determinant Strategies," SN Operations Research Forum, Springer, vol. 3(3), pages 1-22, September.
    68. Guilherme Carmona, 2003. "Monetary trading: An Optimal Exchange System," Game Theory and Information 0309004, University Library of Munich, Germany.
    69. Guilherme Carmona, 2003. "A re-interpretation of the concept of nash equilibrium based on the notion of social institutions," Nova SBE Working Paper Series wp425, Universidade Nova de Lisboa, Nova School of Business and Economics.
    70. Tobie Cusson & Jim Engle-Warnick, 2013. "Observing the Strategies Subjects Identify from Choice Data in a Repeated Prisoner's Dilemma," CIRANO Working Papers 2013s-26, CIRANO.
    71. Horaguchi, Haruo, 1996. "The role of information processing cost as the foundation of bounded rationality in game theory," Economics Letters, Elsevier, vol. 51(3), pages 287-294, June.
    72. Kalai, Ehud & Solan, Eilon, 2003. "Randomization and simplification in dynamic decision-making," Journal of Economic Theory, Elsevier, vol. 111(2), pages 251-264, August.
    73. Ueda, Masahiko, 2023. "Memory-two strategies forming symmetric mutual reinforcement learning equilibrium in repeated prisoners’ dilemma game," Applied Mathematics and Computation, Elsevier, vol. 444(C).
    74. Ortoleva, Pietro, 2013. "The price of flexibility: Towards a theory of Thinking Aversion," Journal of Economic Theory, Elsevier, vol. 148(3), pages 903-934.
    75. Siegfried Berninghaus & Stephan Schosser & Bodo Vogt, 2011. "Complexity of Networking - An Experimental Study of the Network Hawk Dove Game," FEMM Working Papers 110024, Otto-von-Guericke University Magdeburg, Faculty of Economics and Management.
    76. Christoph Kuzmics & Thomas Palfrey & Brian Rogers, 2012. "Symmetric play in repeated allocation games," Discussion Papers 1551, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    77. George J. Mailath & Wojciech Olszewski, 2008. "Folk Theorems with Bounded Recall under (Almost) Perfect Monitoring," PIER Working Paper Archive 08-019, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    78. Lu Hong & Scott E. Page, 1998. "Diversity and Optimality," Research in Economics 98-08-077e, Santa Fe Institute.
    79. Aumann, Robert J., 1997. "Rationality and Bounded Rationality," Games and Economic Behavior, Elsevier, vol. 21(1-2), pages 2-14, October.
    80. Rosenbaum, Janet, 2002. "The Computational Complexity of Nash Equilibria," SocArXiv h63mz, Center for Open Science.
    81. Neme, Alejandro & Quintas, Luis, 1992. "Equilibrium of repeated games with cost of implementation," Journal of Economic Theory, Elsevier, vol. 58(1), pages 105-109, October.
    82. Sabourian, Hamid, 2004. "Bargaining and markets: complexity and the competitive outcome," Journal of Economic Theory, Elsevier, vol. 116(2), pages 189-228, June.
    83. Scott E. Page, 1998. "Uncertainty, Difficulty, and Complexity," Research in Economics 98-08-076e, Santa Fe Institute.
    84. Agranov, M. & Elliott, M., 2017. "Commitment and (In)Efficiency: A Bargaining Experiment," Cambridge Working Papers in Economics 1743, Faculty of Economics, University of Cambridge.
    85. Monte, Daniel, 2013. "Bounded memory and permanent reputations," Journal of Mathematical Economics, Elsevier, vol. 49(5), pages 345-354.
    86. Michael D. McGinnis, 1992. "Deterrence Theory Discussion: I," Journal of Theoretical Politics, , vol. 4(4), pages 443-457, October.
    87. Stanford, William, 2004. "Improvement paths in repeated pure coordination games," Economics Letters, Elsevier, vol. 85(3), pages 341-345, December.
    88. Jihong Lee & Hamid Sabourian, 2005. "Efficiency in Negotiation: Complexity and Costly Bargaining," Birkbeck Working Papers in Economics and Finance 0505, Birkbeck, Department of Economics, Mathematics & Statistics.
    89. Lehrer, Ehud & Solan, Eilon, 2009. "Approachability with bounded memory," Games and Economic Behavior, Elsevier, vol. 66(2), pages 995-1004, July.
    90. Guilherme Carmona, 2006. "A Strong Anti-Folk Theorem," International Journal of Game Theory, Springer;Game Theory Society, vol. 34(1), pages 131-151, April.
    91. Hubie Chen, 2013. "Bounded rationality, strategy simplification, and equilibrium," International Journal of Game Theory, Springer;Game Theory Society, vol. 42(3), pages 593-611, August.
    92. Roy, Jaideep, 2000. "Learning with bounded memory," UC3M Working papers. Economics 7224, Universidad Carlos III de Madrid. Departamento de Economía.
    93. Olivier Gossner & Penélope Hernández & Ron Peretz, 2016. "The complexity of interacting automata," International Journal of Game Theory, Springer;Game Theory Society, vol. 45(1), pages 461-496, March.
    94. Samuelson, Larry, 2001. "Analogies, Adaptation, and Anomalies," Journal of Economic Theory, Elsevier, vol. 97(2), pages 320-366, April.
    95. Katerina Sherstyuk, 2011. "Complexity and bidder behavior in iterative auctions," Economics Bulletin, AccessEcon, vol. 31(4), pages 2769-2776.
    96. Ben-Porath, Elchanan, 1991. "Repeated Games with Finite Automata," Foerder Institute for Economic Research Working Papers 275510, Tel-Aviv University > Foerder Institute for Economic Research.
    97. Guilherme Carmona, 2003. "A Re-Interpretation of Nash Equilibrium Based on the Notion of Social Institutions," Game Theory and Information 0311005, University Library of Munich, Germany.
    98. George J. Mailath & : Wojciech Olszewski, 2008. "Folk Theorems with Bounded Recall under (Almost) Perfect Monitoring, Second Version," PIER Working Paper Archive 08-027, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania, revised 28 Jul 2008.
    99. Jenna Bednar & Scott Page, 2007. "Can Game(s) Theory Explain Culture?," Rationality and Society, , vol. 19(1), pages 65-97, February.

  2. Ehud Kalai & William Stanford, 1982. "Duopoly, Conjectural Variations and Supergames," Discussion Papers 525, Northwestern University, Center for Mathematical Studies in Economics and Management Science.

    Cited by:

    1. Gamal Atallah & Aggey Semenov, 2018. "Technological Progress and Sectoral Shares," Australian Economic Papers, Wiley Blackwell, vol. 57(2), pages 142-153, June.

Articles

  1. Stanford, William, 2004. "Individually rational pure strategies in large games," Games and Economic Behavior, Elsevier, vol. 47(1), pages 221-233, April.

    Cited by:

    1. Stanford, William, 2011. "A family of identities related to zero-sum and team games," Mathematical Social Sciences, Elsevier, vol. 62(2), pages 91-94, September.

  2. Stanford, William, 1999. "On the number of pure strategy Nash equilibria in finite common payoffs games," Economics Letters, Elsevier, vol. 62(1), pages 29-34, January.

    Cited by:

    1. Szabó, György & Borsos, István & Szombati, Edit, 2019. "Games, graphs and Kirchhoff laws," Physica A: Statistical Mechanics and its Applications, Elsevier, vol. 521(C), pages 416-423.
    2. Pei, Ting & Takahashi, Satoru, 2019. "Rationalizable strategies in random games," Games and Economic Behavior, Elsevier, vol. 118(C), pages 110-125.
    3. Marco Scarsini & Yosef Rinott, 2000. "On the number of pure strategy Nash equilibria in random games," Post-Print hal-00540207, HAL.
    4. Torsten Heinrich & Yoojin Jang & Luca Mungo & Marco Pangallo & Alex Scott & Bassel Tarbush & Samuel Wiese, 2023. "Best-response dynamics, playing sequences, and convergence to equilibrium in random games," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(3), pages 703-735, September.
    5. Stanford, William, 2010. "The number of pure strategy Nash equilibria in random multi-team games," Economics Letters, Elsevier, vol. 108(3), pages 352-354, September.
    6. Roberts, David P., 2005. "Pure Nash equilibria of coordination matrix games," Economics Letters, Elsevier, vol. 89(1), pages 7-11, October.
    7. Pangallo, Marco & Heinrich, Torsten & Jang, Yoojin & Scott, Alex & Tarbush, Bassel & Wiese, Samuel & Mungo, Luca, 2021. "Best-Response Dynamics, Playing Sequences, And Convergence To Equilibrium In Random Games," INET Oxford Working Papers 2021-02, Institute for New Economic Thinking at the Oxford Martin School, University of Oxford.
    8. Pangallo, Marco & Heinrich, Torsten & Jang, Yoojin & Scott, Alex & Tarbush, Bassel & Wiese, Samuel & Mungo, Luca, 2021. "Best-Response Dynamics, Playing Sequences, And Convergence To Equilibrium In Random Games," INET Oxford Working Papers 2021-23, Institute for New Economic Thinking at the Oxford Martin School, University of Oxford.
    9. Ben Amiet & Andrea Collevecchio & Marco Scarsini & Ziwen Zhong, 2021. "Pure Nash Equilibria and Best-Response Dynamics in Random Games," Mathematics of Operations Research, INFORMS, vol. 46(4), pages 1552-1572, November.
    10. Takahashi, Satoru, 2008. "The number of pure Nash equilibria in a random game with nondecreasing best responses," Games and Economic Behavior, Elsevier, vol. 63(1), pages 328-340, May.

  3. Stanford, William, 1997. "On the distribution of pure strategy equilibria in finite games with vector payoffs," Mathematical Social Sciences, Elsevier, vol. 33(2), pages 115-127, April.

    Cited by:

    1. Marco Scarsini & Yosef Rinott, 2000. "On the number of pure strategy Nash equilibria in random games," Post-Print hal-00540207, HAL.
    2. Klaus Kultti & Hannu Salonen & Hannu Vartiainen, 2011. "Distribution of pure Nash equilibria in n-person games with random best replies," Discussion Papers 71, Aboa Centre for Economics.
    3. Torsten Heinrich & Yoojin Jang & Luca Mungo & Marco Pangallo & Alex Scott & Bassel Tarbush & Samuel Wiese, 2023. "Best-response dynamics, playing sequences, and convergence to equilibrium in random games," International Journal of Game Theory, Springer;Game Theory Society, vol. 52(3), pages 703-735, September.
    4. Pangallo, Marco & Heinrich, Torsten & Jang, Yoojin & Scott, Alex & Tarbush, Bassel & Wiese, Samuel & Mungo, Luca, 2021. "Best-Response Dynamics, Playing Sequences, And Convergence To Equilibrium In Random Games," INET Oxford Working Papers 2021-02, Institute for New Economic Thinking at the Oxford Martin School, University of Oxford.
    5. Pangallo, Marco & Heinrich, Torsten & Jang, Yoojin & Scott, Alex & Tarbush, Bassel & Wiese, Samuel & Mungo, Luca, 2021. "Best-Response Dynamics, Playing Sequences, And Convergence To Equilibrium In Random Games," INET Oxford Working Papers 2021-23, Institute for New Economic Thinking at the Oxford Martin School, University of Oxford.
    6. Ben Amiet & Andrea Collevecchio & Marco Scarsini & Ziwen Zhong, 2021. "Pure Nash Equilibria and Best-Response Dynamics in Random Games," Mathematics of Operations Research, INFORMS, vol. 46(4), pages 1552-1572, November.
    7. Takahashi, Satoru, 2008. "The number of pure Nash equilibria in a random game with nondecreasing best responses," Games and Economic Behavior, Elsevier, vol. 63(1), pages 328-340, May.

  4. Stanford, William, 1991. "Prestable strategies in discounted duopoly games," Games and Economic Behavior, Elsevier, vol. 3(1), pages 129-144, February.

    Cited by:

    1. Stanford, William, 2004. "Improvement paths in repeated pure coordination games," Economics Letters, Elsevier, vol. 85(3), pages 341-345, December.

  5. Stanford, William, 1989. "Symmetric paths and evolution to equilibrium in the discounted prisoners' dilemma," Economics Letters, Elsevier, vol. 31(2), pages 139-143, December.

    Cited by:

    1. Nachbar, John H & Zame, William R, 1996. "Non-computable Strategies and Discounted Repeated Games," Economic Theory, Springer;Society for the Advancement of Economic Theory (SAET), vol. 8(1), pages 103-122, June.

  6. Kalai, Ehud & Stanford, William, 1988. "Finite Rationality and Interpersonal Complexity in Repeated Games," Econometrica, Econometric Society, vol. 56(2), pages 397-410, March.
    See citations under working paper version above.
  7. Kalai, Ehud & Samet, Dov & Stanford, William, 1988. "A Note on Reactive Equilibria in the Discounted Prisoner's Dilemma and Associated Games," International Journal of Game Theory, Springer;Game Theory Society, vol. 17(3), pages 177-186.

    Cited by:

    1. Ehud Kalai & Alejandro Neme, 1989. "The Strength of a Little Perfection," Discussion Papers 858, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    2. Takahashi, Satoru, 2010. "Community enforcement when players observe partners' past play," Journal of Economic Theory, Elsevier, vol. 145(1), pages 42-62, January.
    3. Fabian Dvorak & Sebastian Fehrler, 2018. "Negotiating Cooperation Under Uncertainty: Communication in Noisy, Indefinitely Repeated Interactions," TWI Research Paper Series 112, Thurgauer Wirtschaftsinstitut, Universität Konstanz.
    4. Olivier Compte & Andrew Postlewaite, 2015. "Plausible cooperation," PSE-Ecole d'économie de Paris (Postprint) halshs-01204780, HAL.
    5. Escobar, Juan F. & Llanes, Gastón, 2018. "Cooperation dynamics in repeated games of adverse selection," Journal of Economic Theory, Elsevier, vol. 176(C), pages 408-443.
    6. Ehud Kalai & William Stanford, 1986. "Finite Rationality and Interpersonal Complexity in Repeated Games," Discussion Papers 679, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    7. Olivier Compte & Andrew Postlewaite, 2013. "Belief free equilibria," PIER Working Paper Archive 13-020, Penn Institute for Economic Research, Department of Economics, University of Pennsylvania.
    8. P. Langlois, 1991. "Perfect Equilibria and Stable Cooperation in the Iterated Prisoner's Dilemma and Related Games," Conflict Management and Peace Science, Peace Science Society (International), vol. 11(2), pages 69-98, February.
    9. Artem Baklanov, 2021. "Reactive Strategies: An Inch of Memory, a Mile of Equilibria," Games, MDPI, vol. 12(2), pages 1-28, May.
    10. Cho, In-Koo & Matsui, Akihiko, 1995. "Induction and the Ramsey policy," Journal of Economic Dynamics and Control, Elsevier, vol. 19(5-7), pages 1113-1140.
    11. Araujo, Luis & Camargo, Braz, 2015. "Limited monitoring and the essentiality of money," Journal of Mathematical Economics, Elsevier, vol. 58(C), pages 32-37.
    12. Ehud Kalai, 1987. "Bounded Rationality and Strategic Complexity in Repeated Games," Discussion Papers 783, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    13. Neyman, Abraham & Okada, Daijiro, 1999. "Strategic Entropy and Complexity in Repeated Games," Games and Economic Behavior, Elsevier, vol. 29(1-2), pages 191-223, October.
    14. Takashi Kamihigashi & Taiji Furusawa, 2006. "Immediately Reactive Equilibria in Infinitely Repeated Games with Additively Separable Continuous Payoffs," Discussion Paper Series 199, Research Institute for Economics & Business Administration, Kobe University.
    15. Takashi Kamihigashi & Taiji Furusawa, 2007. "Global Dynamics in Infinitely Repeated Games with Additively Separable Continuous Payoffs," Discussion Paper Series 210, Research Institute for Economics & Business Administration, Kobe University.
    16. Eric Rasmusen, 1992. "Heterogeneous Players and Specialized Models," Rationality and Society, , vol. 4(1), pages 83-94, January.

  8. Stanford, William G., 1986. "Subgame perfect reaction function equilibria in discounted duopoly supergames are trivial," Journal of Economic Theory, Elsevier, vol. 39(1), pages 226-232, June.

    Cited by:

    1. Ehud Kalai & Alejandro Neme, 1989. "The Strength of a Little Perfection," Discussion Papers 858, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    2. Seo, Jeong-Yun, 1998. "Exchange rate and market power in import price," ISU General Staff Papers 1998010108000013522, Iowa State University, Department of Economics.
    3. Ehud Kalai & William Stanford, 1986. "Finite Rationality and Interpersonal Complexity in Repeated Games," Discussion Papers 679, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    4. Artem Baklanov, 2021. "Reactive Strategies: An Inch of Memory, a Mile of Equilibria," Games, MDPI, vol. 12(2), pages 1-28, May.
    5. Ehud Kalai, 1987. "Bounded Rationality and Strategic Complexity in Repeated Games," Discussion Papers 783, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    6. Friedel Bolle, 2011. "Over- and under-investment according to different benchmarks," Journal of Economics, Springer, vol. 104(3), pages 219-238, November.
    7. Takashi Kamihigashi & Taiji Furusawa, 2007. "Global Dynamics in Infinitely Repeated Games with Additively Separable Continuous Payoffs," Discussion Paper Series 210, Research Institute for Economics & Business Administration, Kobe University.
    8. Lu, Yuanzhu & Wright, Julian, 2010. "Tacit collusion with price-matching punishments," International Journal of Industrial Organization, Elsevier, vol. 28(3), pages 298-306, May.

  9. Stanford, William G., 1986. "On continuous reaction function equilibria in duopoly supergames with mean payoffs," Journal of Economic Theory, Elsevier, vol. 39(1), pages 233-250, June.

    Cited by:

    1. Ehud Kalai & William Stanford, 1986. "Finite Rationality and Interpersonal Complexity in Repeated Games," Discussion Papers 679, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    2. Ehud Kalai, 1987. "Bounded Rationality and Strategic Complexity in Repeated Games," Discussion Papers 783, Northwestern University, Center for Mathematical Studies in Economics and Management Science.
    3. Scott Moss & Huw David Dixon & Steven Wallis, 1995. "Evaluating Competitive Strategies," Intelligent Systems in Accounting, Finance and Management, John Wiley & Sons, Ltd., vol. 4(4), pages 245-258, December.

  10. Kalai, Ehud & Stanford, William, 1985. "Conjectural variations strategies in accelerated cournot games," International Journal of Industrial Organization, Elsevier, vol. 3(2), pages 133-152, June.

    Cited by:

    1. Wright, Julian, 2013. "Punishment strategies in repeated games: Evidence from experimental markets," Games and Economic Behavior, Elsevier, vol. 82(C), pages 91-102.
    2. Richards, Timothy J. & Patterson, Paul M., 2002. "Strategic Interaction With Multiple Tools: A New Empirical Model," Working Papers 28545, Arizona State University, Morrison School of Agribusiness and Resource Management.
    3. Friedman, James W. & Mezzetti, Claudio, 2002. "Bounded rationality, dynamic oligopoly, and conjectural variations," Journal of Economic Behavior & Organization, Elsevier, vol. 49(3), pages 287-306, November.
    4. Andrey Lipin, 2013. "Empirical analysis of imperfect competition in the rice market in the Asia-Pacific region (in Russian)," Quantile, Quantile, issue 11, pages 41-60, December.
    5. Thijssen, J.J.J., 2003. "Investment under uncertainty, market evolution and coalition spillovers in a game theoretic perspective," Other publications TiSEM 672073a6-492e-4621-8d4a-0, Tilburg University, School of Economics and Management.
    6. Jacco Thijssen, 2003. "Evolution of Conjectures in Cournot Oligopoly," Trinity Economics Papers 200316, Trinity College Dublin, Department of Economics.
    7. Louis-André Gérard-Varet & Rodolphe Dos Santos Ferreira & Claude d'Aspremont, 1991. "Concurrence en prix et équilibres cournotiens," Revue Économique, Programme National Persée, vol. 42(6), pages 967-996.
    8. Lu, Yuanzhu & Wright, Julian, 2010. "Tacit collusion with price-matching punishments," International Journal of Industrial Organization, Elsevier, vol. 28(3), pages 298-306, May.

More information

Research fields, statistics, top rankings, if available.

Statistics

Access and download statistics for all items

Co-authorship network on CollEc

Corrections

All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. For general information on how to correct material on RePEc, see these instructions.

To update listings or check citations waiting for approval, William George Stanford should log into the RePEc Author Service.

To make corrections to the bibliographic information of a particular item, find the technical contact on the abstract page of that item. There, details are also given on how to add or correct references and citations.

To link different versions of the same work, where versions have a different title, use this form. Note that if the versions have a very similar title and are in the author's profile, the links will usually be created automatically.

Please note that most corrections can 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.