Imagen de Portada

Tâtonnement Dynamics for Fisher Markets with Chores

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Chaudhury, Bhaskar Ray, Kroer, Christian, Mehta, Ruta, Nan, Tianlong
Formato:	Preprint
Publicado:	2025
Materias:	Computer Science and Game Theory
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

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

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

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

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

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

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

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

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

Matching Markets with Chores
por: Garg, Jugal, et al.
Publicado: (2024)

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

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

Online MMS Allocation for Chores
por: Song, Jiaxin, et al.
Publicado: (2025)

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

Contested Route Planning
por: Černý, Jakub, et al.
Publicado: (2025)

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

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

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

A Note on EFX Inapproximability for Chores
por: Christoforidis, Vasilis
Publicado: (2026)

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

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

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

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

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

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

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

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

Existence of Fair and Efficient Allocation of Indivisible Chores
por: Mahara, Ryoga
Publicado: (2025)

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

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

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

When is Truthfully Allocating Chores no Harder than Goods?
por: Li, Bo, et al.
Publicado: (2025)

Improved Maximin Share Approximations for Chores by Bin Packing
por: Garg, Jugal, et al.
Publicado: (2024)

On the Fairness of Normalized p-Means for Allocating Goods and Chores
por: Eckart, Owen, et al.
Publicado: (2024)

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

Proportional Dynamics in Linear Fisher Markets with Auto-bidding: Convergence, Incentives and Fairness
por: Li, Juncheng, et al.
Publicado: (2024)

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