From the 1 of 25 linked papers with an AI index.
25 papers
From Compensation Design to Budget-Feasible Mechanisms: A Constant Approximation for Subadditive Valuations
Ioannis Anagnostides, Kshipra Bhawalkar, Christopher Liaw +3
Budget-feasible mechanism design is a classic framework introduced by Singer, but there is still a wide gap between existing upper and lower bounds. In this paper, we significantly…
Compensation Design
Ioannis Anagnostides, Kshipra Bhawalkar, Christopher Liaw +5
The paper defines the problem of compensation design, proposing simple cost‑oblivious payment rules that guarantee the existence of pure Nash equilibria with a price of anarchy clo…
The Computational Complexity of Team Zero-Sum Games
Ioannis Anagnostides, Ioannis Panageas, Tuomas Sandholm +1
A celebrated consequence of the minimax theorem is that two-player zero-sum games admit a tractable equilibrium characterization. In many central applications, however, each side c…
Aligning Data-Driven Predictors with Allocation: A Decision-Focused Approach to Survival Analysis
Itai Zilberstein, Ioannis Anagnostides, Tuomas Sandholm
Machine learning predictors have become essential tools for guiding automated decision making. However, a major misalignment persists: predictive models are typically optimized in…
Position: Machine Learning for Heart Transplant Allocation Policy Optimization Should Account for Incentives
Ioannis Anagnostides, Itai Zilberstein, Zachary W. Sollie +2
The allocation of scarce donor organs constitutes one of the most consequential algorithmic challenges in healthcare. While the field is rapidly transitioning from rigid, rule-base…
Swap Regret Minimization Through Response-Based Approachability
Ioannis Anagnostides, Gabriele Farina, Maxwell Fishelson +2
We consider the problem of minimizing different notions of swap regret in online optimization. These forms of regret are tightly connected to correlated equilibrium concepts in gam…