38 citations · 122 across the 32 of their papers we have counts for
42 papers
On the complexity of Pareto-optimal and envy-free lotteries
Ioannis Caragiannis, Kristoffer Arnsfelt Hansen, Nidhi Rathi
We study the classic problem of dividing a collection of indivisible resources in a fair and efficient manner among a set of agents having varied preferences. Pareto optimality is…
Beyond the worst case: Distortion in impartial culture electorates
Ioannis Caragiannis, Karl Fehrs
{\em Distortion} is a well-established notion for quantifying the loss of social welfare that may occur in voting. As voting rules take as input only ordinal information, they are…
Computing better approximate pure Nash equilibria in cut games via semidefinite programming
Ioannis Caragiannis, Zhile Jiang
Cut games are among the most fundamental strategic games in algorithmic game theory. It is well-known that computing an exact pure Nash equilibrium in these games is PLS-hard, so r…
Repeatedly Matching Items to Agents Fairly and Efficiently
Ioannis Caragiannis, Shivika Narang
We consider a novel setting where a set of items are matched to the same set of agents repeatedly over multiple rounds. Each agent gets exactly one item per round, which brings int…
Truthful Aggregation of Budget Proposals with Proportionality Guarantees
Ioannis Caragiannis, George Christodoulou, Nicos Protopapas
We study a participatory budgeting problem, where a set of strategic agents wish to split a divisible budget among different projects, by aggregating their proposals on a single di…
Optimizing over Serial Dictatorships
Ioannis Caragiannis, Nidhi Rathi
Motivated by the success of the serial dictatorship mechanism in social choice settings, we explore its usefulness in tackling various combinatorial optimization problems. We do so…