10 papers
Fully Distributed Tâtonnement for Chores Markets
Bhaskar Ray Chaudhury, Christian Kroer, Ruta Mehta +1
We study price-adjustment dynamics for computing competitive equilibria (CE) in Fisher markets with chores. Unlike in classical goods markets, prices in chores markets are payments…
Efficient Exploration for Iterative Nash Preference Optimization
Tianlong Nan, Xiaopeng Li, Christian Kroer +1
Preference alignment is central to improving large language models, but standard reward-based formulations can be restrictive when human preferences are cyclic, non-transitive, or…
On the Convergence of Alternating Gradient Descent-Ascent in Bilinear Games
Tianlong Nan, Shuvomoy Das Gupta, Garud Iyengar +1
We study the alternating gradient descent-ascent (AltGDA) algorithm in two-player zero-sum games. Alternating methods, where players take turns to update their strategies, have lon…
Tâtonnement Dynamics for Fisher Markets with Chores
Bhaskar Ray Chaudhury, Christian Kroer, Ruta Mehta +1
In this paper, we initiate the study of tâtonnement dynamics in markets with chores. Tâtonnement is a fundamental market dynamics, capturing how prices evolve when they are adjus…
Colonel Blotto with Battlefield Games
Salam Afiouni, Jakub Cerny, Chun Kai Ling +1
We study a class of two-player zero-sum Colonel Blotto games in which, after allocating soldiers across battlefields, players engage in (possibly distinct) normal-form games on eac…
Spatial Branch-and-Bound for Computing Multiplayer Nash Equilibrium
Jakub Äerný, Shuvomoy Das Gupta, Christian Kroer
Equilibria of realistic multiplayer games constitute a key solution concept both in practical applications, such as online advertising auctions and electricity markets, and in anal…