:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Chaudhury, Bhaskar Ray, Kroer, Christian, Mehta, Ruta, Nan, Tianlong
Format:	Preprint
Published:	2025
Subjects:	Computer Science and Game Theory
Online Access:	https://arxiv.org/abs/2511.21162
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Competitive Equilibrium for Chores: from Dual Eisenberg-Gale to a Fast, Greedy, LP-based Algorithm
by: Chaudhury, Bhaskar Ray, et al.
Published: (2024)

On the Convergence of Tâtonnement for Linear Fisher Markets
by: Nan, Tianlong, et al.
Published: (2024)

Tâtonnement in Homothetic Fisher Markets
by: Goktas, Denizalp, et al.
Published: (2023)

Statistical Inference for Fisher Market Equilibrium
by: Liao, Luofeng, et al.
Published: (2022)

Bootstrapping Fisher Market Equilibrium and First-Price Pacing Equilibrium
by: Liao, Luofeng, et al.
Published: (2024)

Statistical Inference and A/B Testing in Fisher Markets and Paced Auctions
by: Liao, Luofeng, et al.
Published: (2024)

Convergence of Extragradient SVRG for Variational Inequalities: Error Bounds and Increasing Iterate Averaging
by: Nan, Tianlong, et al.
Published: (2023)

Revenue-Optimal Pricing for Budget-Constrained Buyers in Data Markets
by: Chaudhury, Bhaskar Ray, et al.
Published: (2026)

On the $O(1/T)$ Convergence of Alternating Gradient Descent-Ascent in Bilinear Games
by: Nan, Tianlong, et al.
Published: (2025)

Human-AI Collaboration with Misaligned Preferences
by: Song, Jiaxin, et al.
Published: (2025)

On the Theoretical Foundations of Data Exchange Economies
by: Akrami, Hannaneh, et al.
Published: (2024)

The Second-Order Tâtonnement: Decentralized Interior-Point Methods for Market Equilibrium
by: Zhang, Chuwen, et al.
Published: (2025)

Matching Markets with Chores
by: Garg, Jugal, et al.
Published: (2024)

On the Existence and Complexity of Core-Stable Data Exchanges
by: Song, Jiaxin, et al.
Published: (2025)

Computing Lindahl Equilibrium for Public Goods with and without Funding Caps
by: Kroer, Christian, et al.
Published: (2025)

On the structure of EFX orientations on graphs
by: Zeng, Jinghan A, et al.
Published: (2024)

Contested Route Planning
by: Černý, Jakub, et al.
Published: (2025)

Online MMS Allocation for Chores
by: Song, Jiaxin, et al.
Published: (2025)

Distribution of Chores with Information Asymmetry
by: Hosseini, Hadi, et al.
Published: (2023)

Spatial Branch-and-Bound for Computing Multiplayer Nash Equilibrium
by: Černý, Jakub, et al.
Published: (2025)

Extensive-Form Game Solving via Blackwell Approachability on Treeplexes
by: Chakrabarti, Darshan, et al.
Published: (2024)

Minimization I.I.D. Prophet Inequality via Extreme Value Theory: A Unified Approach
by: Livanos, Vasilis, et al.
Published: (2024)

Existence of 2-EFX Allocations of Chores
by: Garg, Jugal, et al.
Published: (2025)

Equitable Allocations of Mixtures of Goods and Chores
by: Hosseini, Hadi, et al.
Published: (2025)

Constant-Factor EFX Exists for Chores
by: Garg, Jugal, et al.
Published: (2024)

A Note on EFX Inapproximability for Chores
by: Christoforidis, Vasilis
Published: (2026)

Fair Interval Scheduling of Indivisible Chores
by: Equbal, Sarfaraz, et al.
Published: (2024)

GUARD: Constructing Realistic Two-Player Matrix and Security Games for Benchmarking Game-Theoretic Algorithms
by: Krever, Noah, et al.
Published: (2025)

Fair Division with Indivisible Goods, Chores, and Cake
by: Aziz, Haris, et al.
Published: (2025)

Proportional and Pareto-Optimal Allocation of Chores with Subsidy
by: Garg, Jugal, et al.
Published: (2025)

Approximately EFX and PO Allocations for Bivalued Chores
by: Lin, Zehan, et al.
Published: (2025)

Constant Weighted Maximin Share Approximations for Chores
by: Li, Bo, et al.
Published: (2025)

Existence of Fair and Efficient Allocation of Indivisible Chores
by: Mahara, Ryoga
Published: (2025)

Fair Assignment of Indivisible Chores to Asymmetric Agents
by: Seddighin, Masoud, et al.
Published: (2025)

On The Pursuit of EFX for Chores: Non-Existence and Approximations
by: Christoforidis, Vasilis, et al.
Published: (2024)

Online Fair Division With Subsidy: When Do Envy-Free Allocations Exist, and at What Cost?
by: Kulkarni, Pooja, et al.
Published: (2025)

Colonel Blotto with Battlefield Games
by: Afiouni, Salam, et al.
Published: (2025)

Commitment to Sparse Strategies in Two-Player Games
by: Afiouni, Salam, et al.
Published: (2024)

Layered Graph Security Games
by: Černý, Jakub, et al.
Published: (2024)

Lower Bound for Online MMS Assignment of Indivisible Chores
by: Seddighin, Masoud, et al.
Published: (2025)