Cover Image

A Small Collusion is All You Need

Fuente: arXiv

Saved in:

Bibliographic Details
Main Author:	Gafni, Yotam
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory Theoretical Economics
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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)

Centralization and Stability in Formal Constitutions
by: Gafni, Yotam
Published: (2025)

Scheduling With Time Discounts
by: Gafni, Yotam, et al.
Published: (2024)

Discrete & Bayesian Transaction Fee Mechanisms
by: Gafni, Yotam, et al.
Published: (2022)

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

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

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

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

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)

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

Prediction-sharing During Training and Inference
by: Gafni, Yotam, et al.
Published: (2024)

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

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

Does Your Blockchain Need Multidimensional Transaction Fees?
by: Lavee, Nir, et al.
Published: (2025)

The Bounds of Algorithmic Collusion; $Q$-learning, Gradient Learning, and the Folk Theorem
by: Askenazi-Golan, Galit, et al.
Published: (2024)

Simultaneous All-Pay Auctions with Budget Constraints
by: Liu, Yan, et al.
Published: (2025)

A dynamic auction for multilateral collaboration
by: Huang, Chao
Published: (2024)

A Robust Characterization of Nash Equilibrium
by: Brandl, Florian, et al.
Published: (2023)

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

A choice-based axiomatization of Nash equilibrium
by: Crescenzi, Michele
Published: (2025)

A Geometric Analysis of Gains from Trade
by: Hartline, Jason, et al.
Published: (2025)

Screening and Segmenting: A Consumer Surplus Perspective
by: Bergemann, Dirk, et al.
Published: (2024)

A Solicit-Then-Suggest Model of Agentic Purchasing
by: Cao, Shengyu, et al.
Published: (2026)

A Simple Method for School Choice Lotteries
by: Okumura, Yasunori
Published: (2026)

The effect of competition in contests: A unifying approach
by: Baranski, Andrzej, et al.
Published: (2024)

A New Solution for Cooperative Game with Public Externalities
by: Fan, Juanjuan, et al.
Published: (2025)

A Dynamic Matching Framework for Faster Child Adoptions
by: Highsmith, Terence
Published: (2024)

A Gale-Shapley View of Unique Stable Marriages
by: Gokhale, Kartik, et al.
Published: (2023)

Preference Restrictions in Computational Social Choice: A Survey
by: Elkind, Edith, et al.
Published: (2022)

Blotto on the Ballot: A Ballot Stuffing Blotto Game
by: Shah, Harsh, et al.
Published: (2024)

A characterization of absorbing sets in coalition formation games
by: Bonifacio, Agustin G., et al.
Published: (2020)

A Generalised $λ$-Core Concept for Normal Form Games
by: Chakrabarti, Subhadip, et al.
Published: (2024)

A Theory of Network Games Part 1: Utility Representations
by: Root, Joseph, et al.
Published: (2026)

Fisher Meets Lindahl: A Unified Duality Framework for Market Equilibrium
by: Tao, Yixin, et al.
Published: (2025)

Procurement without Priors: A Simple Mechanism and its Notable Performance
by: Bergemann, Dirk, et al.
Published: (2025)

Maximum Flow is Fair: A Network Flow Approach to Committee Voting
by: Suzuki, Mashbat, et al.
Published: (2024)

A General Framework for a Class of Quarrels: The Quarrelling Paradox Revisited
by: Abizadeh, Arash, et al.
Published: (2022)

Optimized Cost Per Click in Online Advertising: A Theoretical Analysis
by: Zhang, Kaichen, et al.
Published: (2024)