:: Library Catalog

Image de couverture de livre

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Chaudhury, Bhaskar Ray, Kroer, Christian, Mehta, Ruta, Nan, Tianlong
Format:	Preprint
Publié:	2025
Sujets:	Computer Science and Game Theory
Accès en ligne:	https://arxiv.org/abs/2511.21162
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Competitive Equilibrium for Chores: from Dual Eisenberg-Gale to a Fast, Greedy, LP-based Algorithm
par: Chaudhury, Bhaskar Ray, et autres
Publié: (2024)

On the Convergence of Tâtonnement for Linear Fisher Markets
par: Nan, Tianlong, et autres
Publié: (2024)

Tâtonnement in Homothetic Fisher Markets
par: Goktas, Denizalp, et autres
Publié: (2023)

Statistical Inference for Fisher Market Equilibrium
par: Liao, Luofeng, et autres
Publié: (2022)

Bootstrapping Fisher Market Equilibrium and First-Price Pacing Equilibrium
par: Liao, Luofeng, et autres
Publié: (2024)

Statistical Inference and A/B Testing in Fisher Markets and Paced Auctions
par: Liao, Luofeng, et autres
Publié: (2024)

Convergence of Extragradient SVRG for Variational Inequalities: Error Bounds and Increasing Iterate Averaging
par: Nan, Tianlong, et autres
Publié: (2023)

Revenue-Optimal Pricing for Budget-Constrained Buyers in Data Markets
par: Chaudhury, Bhaskar Ray, et autres
Publié: (2026)

On the $O(1/T)$ Convergence of Alternating Gradient Descent-Ascent in Bilinear Games
par: Nan, Tianlong, et autres
Publié: (2025)

Human-AI Collaboration with Misaligned Preferences
par: Song, Jiaxin, et autres
Publié: (2025)

On the Theoretical Foundations of Data Exchange Economies
par: Akrami, Hannaneh, et autres
Publié: (2024)

The Second-Order Tâtonnement: Decentralized Interior-Point Methods for Market Equilibrium
par: Zhang, Chuwen, et autres
Publié: (2025)

Matching Markets with Chores
par: Garg, Jugal, et autres
Publié: (2024)

On the Existence and Complexity of Core-Stable Data Exchanges
par: Song, Jiaxin, et autres
Publié: (2025)

Computing Lindahl Equilibrium for Public Goods with and without Funding Caps
par: Kroer, Christian, et autres
Publié: (2025)

On the structure of EFX orientations on graphs
par: Zeng, Jinghan A, et autres
Publié: (2024)

Contested Route Planning
par: Černý, Jakub, et autres
Publié: (2025)

Online MMS Allocation for Chores
par: Song, Jiaxin, et autres
Publié: (2025)

Distribution of Chores with Information Asymmetry
par: Hosseini, Hadi, et autres
Publié: (2023)

Spatial Branch-and-Bound for Computing Multiplayer Nash Equilibrium
par: Černý, Jakub, et autres
Publié: (2025)

Extensive-Form Game Solving via Blackwell Approachability on Treeplexes
par: Chakrabarti, Darshan, et autres
Publié: (2024)

Minimization I.I.D. Prophet Inequality via Extreme Value Theory: A Unified Approach
par: Livanos, Vasilis, et autres
Publié: (2024)

Existence of 2-EFX Allocations of Chores
par: Garg, Jugal, et autres
Publié: (2025)

Equitable Allocations of Mixtures of Goods and Chores
par: Hosseini, Hadi, et autres
Publié: (2025)

Constant-Factor EFX Exists for Chores
par: Garg, Jugal, et autres
Publié: (2024)

A Note on EFX Inapproximability for Chores
par: Christoforidis, Vasilis
Publié: (2026)

Fair Interval Scheduling of Indivisible Chores
par: Equbal, Sarfaraz, et autres
Publié: (2024)

GUARD: Constructing Realistic Two-Player Matrix and Security Games for Benchmarking Game-Theoretic Algorithms
par: Krever, Noah, et autres
Publié: (2025)

Fair Division with Indivisible Goods, Chores, and Cake
par: Aziz, Haris, et autres
Publié: (2025)

Proportional and Pareto-Optimal Allocation of Chores with Subsidy
par: Garg, Jugal, et autres
Publié: (2025)

Approximately EFX and PO Allocations for Bivalued Chores
par: Lin, Zehan, et autres
Publié: (2025)

Constant Weighted Maximin Share Approximations for Chores
par: Li, Bo, et autres
Publié: (2025)

Existence of Fair and Efficient Allocation of Indivisible Chores
par: Mahara, Ryoga
Publié: (2025)

Fair Assignment of Indivisible Chores to Asymmetric Agents
par: Seddighin, Masoud, et autres
Publié: (2025)

On The Pursuit of EFX for Chores: Non-Existence and Approximations
par: Christoforidis, Vasilis, et autres
Publié: (2024)

Online Fair Division With Subsidy: When Do Envy-Free Allocations Exist, and at What Cost?
par: Kulkarni, Pooja, et autres
Publié: (2025)

Colonel Blotto with Battlefield Games
par: Afiouni, Salam, et autres
Publié: (2025)

Commitment to Sparse Strategies in Two-Player Games
par: Afiouni, Salam, et autres
Publié: (2024)

Layered Graph Security Games
par: Černý, Jakub, et autres
Publié: (2024)

Lower Bound for Online MMS Assignment of Indivisible Chores
par: Seddighin, Masoud, et autres
Publié: (2025)