Papers
Topics
Authors
Recent
Search
2000 character limit reached

Learned Collusion

Published 25 Apr 2023 in econ.TH, cs.AI, and cs.GT | (2304.12647v3)

Abstract: Q-learning can be described as an all-purpose automaton that provides estimates (Q-values) of the continuation values associated with each available action and follows the naive policy of almost always choosing the action with highest Q-value. We consider a family of automata based on Q-values, whose policy may systematically favor some actions over others, for example through a bias that favors cooperation. We look for stable equilibrium biases, easily learned under converging logit/best-response dynamics over biases, not requiring any tacit agreement. These biases strongly foster collusion or cooperation across a rich array of payoff and monitoring structures, independently of initial Q-values.

Authors (1)
Definition Search Book Streamline Icon: https://streamlinehq.com
References (31)
  1. Toward a theory of discounted repeated games with imperfect monitoring. Econometrica, 58(5):1041–1063, 1990.
  2. Artificial intelligence, algorithm design, and pricing. AEA Papers and Proceedings, 112:452–56, May 2022.
  3. Peter Auer. Using confidence bounds for exploitation-exploration trade-offs. J. Mach. Learn. Res., 3:397–422, 2002.
  4. Robert Axelrod. The Evolution of Cooperation. Basic Books, New York, 1984.
  5. Adaptive algorithms and collusion via coupling, 2022. URL https://arxiv.org/abs/2202.05946.
  6. Artificial intelligence and auction design, 2022.
  7. Modeling the effects of environmental and perceptual uncertainty using deterministic reinforcement learning dynamics with partial observability. Phys. Rev. E, 105:034409, Mar 2022.
  8. Competition in pricing algorithms, 2021.
  9. Artificial intelligence, algorithmic pricing, and collusion. American Economic Review, 110(10):3267–97, October 2020.
  10. Algorithmic pricing with imperfect monitoring. International Journal of Industrial Organization, 79102712, 2021.
  11. Olivier Compte. Private observations, communication and coordination in repeated games. Ph.D. Thesis Stanford, 1994.
  12. Olivier Compte. On sustaining cooperation without public observations. Journal of Economic Theory, 102(1):106–150, January 2002.
  13. Plausible cooperation. Games and Economic Behavior, 91:45–59, 2015.
  14. Ignorance and Uncertainty. Econometric Society Monographs. Cambridge University Press, 2018. doi: 10.1017/9781108379991.
  15. A robust folk theorem for the prisoner’s dilemma. J. Econ. Theory, 102:84–105, 2002.
  16. Berk-nash equilibrium: A framework for modeling agents with misspecified models. Econometrica, 84(3):1093–1130, 2016.
  17. Reputation and equilibrium selection in games with a patient player. Econometrica, 57(4):759–778, 1989.
  18. The folk theorem in repeated games with discounting or with incomplete information. Econometrica, 54(3):533–554, 1986.
  19. The folk theorem with imperfect public information. Econometrica, 62(5):997–1039, 1994.
  20. Frontiers: Algorithmic collusion: Supra-competitive prices via independent algorithms. Marketing Science, 40(1):1–12, 2021. doi: 10.1287/mksc.2020.1276.
  21. Philippe Jehiel. Analogy-based expectation equilibrium. Journal of Economic Theory, 123(2):81–104, 2005.
  22. Evolving aspirations and cooperation. Journal of Economic Theory, 80(2):292–331, 1998.
  23. Timo Klein. Autonomous algorithmic collusion: Q-learning under sequential pricing. The RAND Journal of Economics, 52(3):538–558, 2021.
  24. Repeated games and reputations: long-run relationships. Oxford University Press, 2006.
  25. Games with procedurally rational players. The American Economic Review, 88(4):834–847, 1998.
  26. Michele Piccione. The repeated prisoner’s dilemma with imperfect private monitoring. Journal of Economic Theory, 102(1):70–83, 2002.
  27. Tadashi Sekiguchi. Efficiency in repeated prisoner’s dilemma with private monitoring. Journal of Economic Theory, 76(2):345–361, 1997.
  28. Herbert A. Simon. A behavioral model of rational choice. The Quarterly Journal of Economics, 69(1):99–118, 1955.
  29. Learning without state-estimation in partially observable markovian decision processes. In William W. Cohen and Haym Hirsh, editors, Machine Learning Proceedings 1994, pages 284–292. Morgan Kaufmann, San Francisco (CA), 1994.
  30. Takuo Sugaya. Folk theorem in repeated games with private monitoring. The Review of Economic Studies, 89(4):2201–2256, 11 2022.
  31. Q-learning. Machine Learning, 8(3):279–292, 1992.

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Collections

Sign up for free to add this paper to one or more collections.