Cover Image

The Bounds of Algorithmic Collusion; $Q$-learning, Gradient Learning, and the Folk Theorem

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Askenazi-Golan, Galit, Cecchelli, Domenico Mergoni, Plumb, Edward, Possnig, Clemens
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory Theoretical Economics Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Simultaneous Best-Response Dynamics in Random Potential Games
by: Ashkenazi-Golan, Galit, et al.
Published: (2025)

Algorithmic Collusion Without Threats
by: Arunachaleswaran, Eshwar Ram, et al.
Published: (2024)

Algorithmic Collusion is Algorithm Orchestration
by: Carissimo, Cesare, et al.
Published: (2025)

Regulation of Algorithmic Collusion
by: Hartline, Jason D., et al.
Published: (2024)

Clarification of `Algorithmic Collusion without Threats'
by: Hartline, Jason
Published: (2026)

Collusion-proof Auction Design using Side Information
by: Kudva, Sukanya, et al.
Published: (2025)

Regulation of Algorithmic Collusion, Refined: Testing Pessimistic Calibrated Regret
by: Hartline, Jason D., et al.
Published: (2025)

On Mechanism Underlying Algorithmic Collusion
by: Xu, Zhang, et al.
Published: (2024)

Learned Collusion
by: Compte, Olivier
Published: (2023)

Collusion-Resilience in Transaction Fee Mechanism Design
by: Chung, Hao, et al.
Published: (2024)

A Small Collusion is All You Need
by: Gafni, Yotam
Published: (2025)

Barriers to Collusion-resistant Transaction Fee Mechanisms
by: Gafni, Yotam, et al.
Published: (2024)

Incentive-Compatible Collusion-Resistance via Posted Prices
by: Ferreira, Matheus V. X., et al.
Published: (2024)

Sustaining Cooperation in Populations Guided by AI: A Folk Theorem for LLMs
by: Shaki, Jonathan, et al.
Published: (2026)

Coarse Q-learning: Indifference, Indeterminacy, and Instability
by: Jehiel, Philippe, et al.
Published: (2024)

A Geometric Nash Approach in Tuning the Learning Rate in Q-Learning Algorithm
by: Bonsu, Kwadwo Osei
Published: (2024)

Rationalizability, Iterated Dominance, and the Theorems of Radon and Carathéodory
by: Long, Roy
Published: (2024)

Swap Bounded Envy
by: Echenique, Federico, et al.
Published: (2025)

Tight Efficiency Bounds for the Probabilistic Serial and Related Mechanisms
by: Garg, Jugal, et al.
Published: (2025)

Fair Division with Bounded Sharing: Binary and Non-Degenerate Valuations
by: Bismuth, Samuel, et al.
Published: (2019)

Algorithmic Fairness and Social Welfare
by: Liang, Annie, et al.
Published: (2024)

The Welfare Gap of Strategic Storage: Universal Bounds and Price Non-Linearity
by: Jiang, Zhile, et al.
Published: (2026)

Cycles and collusion in congestion games under Q-learning
by: Carissimo, Cesare, et al.
Published: (2025)

Algorithmic Information Disclosure in Optimal Auctions
by: Cai, Yang, et al.
Published: (2024)

Algorithmic Contract Theory: A Survey
by: Duetting, Paul, et al.
Published: (2024)

Misspecified learning and evolutionary stability
by: He, Kevin, et al.
Published: (2025)

Wardrop Equilibrium Can Be Boundedly Rational: A New Behavioral Theory of Route Choice
by: Li, Jiayang, et al.
Published: (2023)

Fair Core Imputations for the Assignment Game: New Solution Concepts and Efficient Algorithms
by: Vazirani, Vijay V.
Published: (2024)

Deep Learning for Double Auction
by: Liu, Jiayin, et al.
Published: (2025)

Randomized Truthful Auctions with Learning Agents
by: Aggarwal, Gagan, et al.
Published: (2024)

Networked Information Aggregation via Machine Learning
by: Kearns, Michael, et al.
Published: (2025)

Multiplayer Bandit Learning, from Competition to Cooperation
by: Brânzei, Simina, et al.
Published: (2019)

Learning to Coordinate Bidders in Non-Truthful Auctions
by: Fu, Hu, et al.
Published: (2025)

From No-Regret to Strategically Robust Learning in Repeated Auctions
by: Zhao, Junyao
Published: (2026)

Learning to Play Multi-Follower Bayesian Stackelberg Games
by: Personnat, Gerson, et al.
Published: (2025)

Persuading a Behavioral Agent: Approximately Best Responding and Learning
by: Chen, Yiling, et al.
Published: (2023)

Robust Learning with Private Information
by: Okumura, Kyohei
Published: (2025)

The Hazards and Benefits of Condescension in Social Learning
by: Arieli, Itai, et al.
Published: (2023)

Learning and Communication Towards Unanimous Consent
by: Li, Yingkai, et al.
Published: (2024)

The Economics of No-regret Learning Algorithms
by: Hartline, Jason
Published: (2026)