Cover Image

Efficiently Solving Turn-Taking Stochastic Games with Extensive-Form Correlation

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Zhang, Hanrui, Cheng, Yu, Conitzer, Vincent
Format:	Preprint
Published:	2024
Subjects:	Computer Science and Game Theory Artificial Intelligence Data Structures and Algorithms Machine Learning
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

The complexity of approximate (coarse) correlated equilibrium for incomplete information games
by: Peng, Binghui, et al.
Published: (2024)

Regret Bounds for Competitive Resource Allocation with Endogenous Costs
by: Chai, Rui
Published: (2026)

Learning in Repeated Multi-Unit Pay-As-Bid Auctions
by: Galgana, Rigel, et al.
Published: (2023)

Anytime-Constrained Equilibria in Polynomial Time
by: McMahan, Jeremy
Published: (2024)

Contextual Learning for Stochastic Optimization
by: Heuser, Anna, et al.
Published: (2025)

Facility Location Games Beyond Single-Peakedness: the Entrance Fee Model
by: Ma, Mengfan, et al.
Published: (2022)

Learning in Stackelberg Games with Non-myopic Agents
by: Haghtalab, Nika, et al.
Published: (2022)

Roping in Uncertainty: Robustness and Regularization in Markov Games
by: McMahan, Jeremy, et al.
Published: (2024)

Stochastic Online Correlated Selection
by: Chen, Ziyun, et al.
Published: (2024)

Solving Woeginger's Hiking Problem: Wonderful Partitions in Anonymous Hedonic Games
by: Constantinescu, Andrei, et al.
Published: (2023)

Efficiency of Proportional Mechanisms in Online Auto-Bidding Advertising
by: Thang, Nguyen Kim
Published: (2026)

Replication-proof Bandit Mechanism Design with Bayesian Agents
by: Shin, Suho, et al.
Published: (2023)

Couples can be tractable: New algorithms and hardness results for the Hospitals / Residents problem with Couples
by: Csáji, Gergely, et al.
Published: (2023)

Covering a Few Submodular Constraints and Applications
by: Bajpai, Tanvi, et al.
Published: (2025)

Gerrymandering Planar Graphs
by: Dippel, Jack, et al.
Published: (2023)

Probing EFX via PMMS: (Non-)Existence Results in Discrete Fair Division
by: Byrka, Jarosław, et al.
Published: (2025)

Efficient Approximation Schemes for Stochastic Probing and Selection-Stopping Problems
by: Segev, Danny, et al.
Published: (2020)

High dimensional online calibration in polynomial time
by: Peng, Binghui
Published: (2025)

Repeated Bilateral Trade Against a Smoothed Adversary
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023)

Improved Regret and Contextual Linear Extension for Pandora's Box and Prophet Inequality
by: Liu, Junyan, et al.
Published: (2025)

Repeated Contracting with Multiple Non-Myopic Agents: Policy Regret and Limited Liability
by: Collina, Natalie, et al.
Published: (2024)

Online Bidding Algorithms with Strict Return on Spend (ROS) Constraint
by: Vaze, Rahul, et al.
Published: (2025)

High-Dimensional Calibration from Swap Regret
by: Fishelson, Maxwell, et al.
Published: (2025)

On the Learning Curves of Revenue Maximization
by: Hanneke, Steve, et al.
Published: (2026)

An $α$-regret analysis of Adversarial Bilateral Trade
by: Azar, Yossi, et al.
Published: (2022)

Fixed Point Computation: Beating Brute Force with Smoothed Analysis
by: Attias, Idan, et al.
Published: (2025)

Bandit Sequential Posted Pricing via Half-Concavity
by: Singla, Sahil, et al.
Published: (2023)

Strategizing against No-Regret Learners in First-Price Auctions
by: Rubinstein, Aviad, et al.
Published: (2024)

The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
by: Cesa-Bianchi, Nicolò, et al.
Published: (2023)

Simultaneous Swap Regret Minimization via KL-Calibration
by: Luo, Haipeng, et al.
Published: (2025)

Collaborative Prediction: Tractable Information Aggregation via Agreement
by: Collina, Natalie, et al.
Published: (2025)

Learning Safe Strategies for Value Maximizing Buyers in Uniform Price Auctions
by: Golrezaei, Negin, et al.
Published: (2024)

Bandit Social Learning: Exploration under Myopic Behavior
by: Banihashem, Kiarash, et al.
Published: (2023)

Smooth Nash Equilibria: Algorithms and Complexity
by: Daskalakis, Constantinos, et al.
Published: (2023)

Water-Filling is Universally Minimax Optimal
by: Banerjee, Siddhartha, et al.
Published: (2026)

Incentivizing Exploration with Selective Data Disclosure
by: Immorlica, Nicole, et al.
Published: (2018)

Learning Optimal Posted Prices for a Unit-Demand Buyer
by: Teng, Yifeng, et al.
Published: (2025)

Adaptive Discretization against an Adversary: Lipschitz bandits, Dynamic Pricing, and Auction Tuning
by: Podimata, Chara, et al.
Published: (2020)

Procurement Auctions via Approximately Optimal Submodular Optimization
by: Deng, Yuan, et al.
Published: (2024)

Single-Sample and Robust Online Resource Allocation
by: Ghuge, Rohan, et al.
Published: (2025)