5 citations · 15 across the 14 of their papers we have counts for
19 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…
Computational Complexity of Multi-Player Evolutionarily Stable Strategies
Manon Blanc, Kristoffer Arnsfelt Hansen
In this paper we study the computational complexity of computing an evolutionary stable strategy (ESS) in multi-player symmetric games. For two-player games, deciding existence of…
FIXP-membership via Convex Optimization: Games, Cakes, and Markets
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh +1
We introduce a new technique for proving membership of problems in FIXP - the class capturing the complexity of computing a fixed-point of an algebraic circuit. Our technique const…
Computational Complexity of Computing a Quasi-Proper Equilibrium
Kristoffer Arnsfelt Hansen, Troels Bjerre Lund
We study the computational complexity of computing or approximating a quasi-proper equilibrium for a given finite extensive form game of perfect recall. We show that the task of co…
Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem
Eleni Batziou, Kristoffer Arnsfelt Hansen, Kasper Høgh
In the consensus halving problem we are given n agents with valuations over the interval . The goal is to divide the interval into at most pieces (by placing at most n…
Existential Theory of the Reals Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games
Kristoffer Arnsfelt Hansen, Steffan Christ Sølvsten
We show that the problem of deciding whether in a multi-player perfect information recursive game (i.e. a stochastic game with terminal rewards) there exists a stationary Nash equi…