:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Xiong, Yi, Chen, Ningyuan, Gao, Xuefeng
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory Machine Learning
Online Access:	https://arxiv.org/abs/2405.17463
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Breaking Algorithmic Collusion in Human-AI Ecosystems
by: Collina, Natalie, et al.
Published: (2025)

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

Impact of Price Inflation on Algorithmic Collusion Through Reinforcement Learning Agents
by: Tinoco, Sebastián, 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)

How Market Volatility Shapes Algorithmic Collusion: A Comparative Analysis of Learning-Based Pricing Algorithms
by: Sravon, Aheer, et al.
Published: (2025)

Optimistic Thompson Sampling for No-Regret Learning in Unknown Games
by: Li, Yingru, et al.
Published: (2024)

Learning and Collusion in Multi-unit Auctions
by: Brânzei, Simina, et al.
Published: (2023)

Evaluating LLM Agent Collusion in Double Auctions
by: Agrawal, Kushal, et al.
Published: (2025)

Algorithmic Pricing and Algorithmic Collusion
by: Bichler, Martin, et al.
Published: (2025)

Algorithmic Collusion of Pricing and Advertising on E-commerce Platforms
by: Zhao, Hangcheng, et al.
Published: (2025)

Algorithmic Robust Forecast Aggregation
by: Guo, Yongkang, 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)

Online Optimization Algorithms in Repeated Price Competition: Equilibrium Learning and Algorithmic Collusion
by: Bichler, Martin, et al.
Published: (2024)

How Sampling Shapes LLM Alignment: From One-Shot Optima to Iterative Dynamics
by: Chen, Yurong, et al.
Published: (2026)

On Randomized Algorithms in Online Strategic Classification
by: Hutton, Chase, et al.
Published: (2026)

Algorithmic Collective Action in Machine Learning
by: Hardt, Moritz, et al.
Published: (2023)

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

Computing Pure-Strategy Nash Equilibria in a Two-Party Policy Competition: Existence and Algorithmic Approaches
by: Lin, Chuang-Chieh, et al.
Published: (2025)

Improving Sample Efficiency of Model-Free Algorithms for Zero-Sum Markov Games
by: Feng, Songtao, et al.
Published: (2023)

Adaptive Bandit Algorithms for Contextual Matching Markets
by: Lin, Shiyun, et al.
Published: (2026)

Strategic Hiring under Algorithmic Monoculture
by: Baek, Jackie, et al.
Published: (2025)

On the Convergence of Federated Learning Algorithms without Data Similarity
by: Beikmohammadi, Ali, et al.
Published: (2024)

Dynamic Reserve Price Design with Distributed Solving Algorithm
by: Li, Mang
Published: (2022)

No-Regret Algorithms in non-Truthful Auctions with Budget and ROI Constraints
by: Aggarwal, Gagan, et al.
Published: (2024)

Strategically-Robust Learning Algorithms for Bidding in First-Price Auctions
by: Kumar, Rachitesh, et al.
Published: (2024)

Last-Iterate Convergence Properties of Regret-Matching Algorithms in Games
by: Cai, Yang, et al.
Published: (2023)

Refined Sample Complexity for Markov Games with Independent Linear Function Approximation
by: Dai, Yan, et al.
Published: (2024)

Sample Efficient Omniprediction and Downstream Swap Regret for Non-Linear Losses
by: Lu, Jiuyao, et al.
Published: (2025)

Geometry Meets Incentives: Sample-Efficient Incentivized Exploration with Linear Contexts
by: Schiffer, Benjamin, et al.
Published: (2025)

Density-Based Algorithms for Corruption-Robust Contextual Search and Convex Optimization
by: Leme, Renato Paes, et al.
Published: (2022)

Robust and Performance Incentivizing Algorithms for Multi-Armed Bandits with Strategic Agents
by: Esmaeili, Seyed A., et al.
Published: (2023)

Data Reliability Scoring
by: Chen, Yiling, et al.
Published: (2025)

Learning from Random Demonstrations: Offline Reinforcement Learning with Importance-Sampled Diffusion Models
by: Fang, Zeyu, et al.
Published: (2024)

Optimal Scoring Rule Design under Partial Knowledge
by: Chen, Yiling, et al.
Published: (2021)

A Bayesian Learning Algorithm for Unknown Zero-sum Stochastic Games with an Arbitrary Opponent
by: Jafarnia-Jahromi, Mehdi, et al.
Published: (2021)

Learnable Mixed Nash Equilibria are Collectively Rational
by: So, Geelon, et al.
Published: (2025)

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

Efficient Near-Optimal Algorithm for Online Shortest Paths in Directed Acyclic Graphs with Bandit Feedback Against Adaptive Adversaries
by: Maiti, Arnab, et al.
Published: (2025)

Efficient Last-iterate Convergence Algorithms in Solving Games
by: Meng, Linjian, et al.
Published: (2023)