Kristoffer Arnsfelt Hansen

Publication Activity (10 Years)

Years Active: 2002-2024
Publications (10 Years): 34

Top Topics

Stochastic Games

Computational Complexity

Nash Equilibria

Top Venues

Theory Comput. Syst.

Publications

Ioannis Caragiannis, Kristoffer Arnsfelt Hansen, Nidhi Rathi
On the Complexity of Pareto-Optimal and Envy-Free Lotteries. AAMAS (2024)
Ioannis Caragiannis, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Kristoffer Arnsfelt Hansen, Zihan Tan
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship. Math. Program. 203 (1) (2024)
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender
PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization. STOC (2024)
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender
PPAD-membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization. CoRR (2023)
Ioannis Caragiannis, Kristoffer Arnsfelt Hansen, Nidhi Rathi
On the complexity of Pareto-optimal and envy-free lotteries. CoRR (2023)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Abraham Neyman
The Big Match with a Clock and a Bit of Memory. Math. Oper. Res. 48 (1) (2023)
Vittorio Bilò, Kristoffer Arnsfelt Hansen, Marios Mavronicolas
Computational Complexity of Decision Problems About Nash Equilibria in Win-Lose Multi-player Games. SAGT (2023)
Marie Louisa Tølbøll Berthelsen, Kristoffer Arnsfelt Hansen
On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria. Theory Comput. Syst. 66 (3) (2022)
Manon Blanc, Kristoffer Arnsfelt Hansen
Computational Complexity of Multi-Player Evolutionarily Stable Strategies. CoRR (2022)
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender
FIXP-membership via Convex Optimization: Games, Cakes, and Markets. FOCS (2022)
Eleni Batziou, Kristoffer Arnsfelt Hansen, Kasper Høgh
Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem. ICALP (2021)
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender
FIXP-membership via Convex Optimization: Games, Cakes, and Markets. FOCS (2021)
Eleni Batziou, Kristoffer Arnsfelt Hansen, Kasper Høgh
Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem. CoRR (2021)
Aris Filos-Ratsikas, Kristoffer Arnsfelt Hansen, Kasper Høgh, Alexandros Hollender
FIXP-membership via Convex Optimization: Games, Cakes, and Markets. CoRR (2021)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Abraham Neyman
Absorbing games with a clock and two bits of memory. Games Econ. Behav. 128 (2021)
Kristoffer Arnsfelt Hansen, Troels Bjerre Lund
Computational Complexity of Computing a Quasi-Proper Equilibrium. FCT (2021)
Kristoffer Arnsfelt Hansen, Troels Bjerre Lund
Computational Complexity of Computing a Quasi-Proper Equilibrium. CoRR (2021)
Manon Blanc, Kristoffer Arnsfelt Hansen
Computational Complexity of Multi-player Evolutionarily Stable Strategies. CSR (2021)
Kristoffer Arnsfelt Hansen, Steffan Christ Sølvsten
∃ℝ-Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games. MFCS (2020)
Kristoffer Arnsfelt Hansen, Steffan Christ Sølvsten
Existential Theory of the Reals Completeness of Stationary Nash Equilibria in Perfect Information Stochastic Games. CoRR (2020)
Marie Louisa Tølbøll Berthelsen, Kristoffer Arnsfelt Hansen
On the Computational Complexity of Decision Problems about Multi-Player Nash Equilibria. CoRR (2020)
Kristoffer Arnsfelt Hansen, Mikhail A. Raskin
A Stay-in-a-Set Game without a Stationary Equilibrium. GandALF (2019)
Marie Louisa Tølbøll Berthelsen, Kristoffer Arnsfelt Hansen
On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria. SAGT (2019)
Kristoffer Arnsfelt Hansen
The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games. Theory Comput. Syst. 63 (7) (2019)
Kristoffer Arnsfelt Hansen, Troels Bjerre Lund
Computational Complexity of Proper Equilibrium. EC (2018)
Chen Dan, Kristoffer Arnsfelt Hansen, He Jiang, Liwei Wang, Yuchen Zhou
Low Rank Approximation of Binary Matrices: Column Subset Selection and Generalizations. MFCS (2018)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Abraham Neyman
The Big Match with a Clock and a Bit of Memory. EC (2018)
Kristoffer Arnsfelt Hansen
The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games. SAGT (2017)
Branislav Bosanský, Simina Brânzei, Kristoffer Arnsfelt Hansen, Troels Bjerre Lund, Peter Bro Miltersen
Computation of Stackelberg Equilibria of Finite Sequential Games. ACM Trans. Economics and Comput. 5 (4) (2017)
Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen
Strategy Complexity of Concurrent Safety Games. MFCS (2017)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Michal Koucký
The Big Match in Small Space - (Extended Abstract). SAGT (2016)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Michal Koucký
The Big Match in Small Space. CoRR (2016)
Ioannis Caragiannis, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Kristoffer Arnsfelt Hansen, Zihan Tan
Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship. WINE (2016)
Ioannis Caragiannis, Aris Filos-Ratsikas, Søren Kristoffer Stiil Frederiksen, Kristoffer Arnsfelt Hansen, Zihan Tan
Truthful Facility Assignment with Resource Augmentation: An Exact Analysis of Serial Dictatorship. CoRR (2016)
Branislav Bosanský, Simina Brânzei, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Computation of Stackelberg Equilibria of Finite Sequential Games. WINE (2015)
Branislav Bosanský, Simina Brânzei, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Computation of Stackelberg Equilibria of Finite Sequential Games. CoRR (2015)
Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii
Polynomial threshold functions and Boolean threshold circuits. Inf. Comput. 240 (2015)
Krishnendu Chatterjee, Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen
Strategy Complexity of Concurrent Stochastic Games with Safety and Reachability Objectives. CoRR (2015)
Chen Dan, Kristoffer Arnsfelt Hansen, He Jiang, Liwei Wang, Yuchen Zhou
On Low Rank Approximation of Binary Matrices. CoRR (2015)
Kousha Etessami, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
The complexity of approximating a trembling hand perfect equilibrium of a multi-player game in strategic form. CoRR (2014)
Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien
Learning Read-Constant Polynomials of Constant Degree Modulo Composites. Theory Comput. Syst. 55 (2) (2014)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
The Complexity of Solving Reachability Games Using Value and Strategy Iteration. Theory Comput. Syst. 55 (2) (2014)
Kousha Etessami, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. SAGT (2014)
Kristoffer Arnsfelt Hansen, Balagopal Komarath, Jayalal Sarma, Sven Skyum, Navid Talebanfard
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. MFCS (2) (2014)
Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii
Polynomial threshold functions and Boolean threshold circuits. Electron. Colloquium Comput. Complex. 20 (2013)
Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola
Tight Bounds on Computing Error-Correcting Codes by Bounded-Depth Circuits With Arbitrary Gates. IEEE Trans. Inf. Theory 59 (10) (2013)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii, Elias P. Tsigaridas
Patience of matrix games. Discret. Appl. Math. 161 (16-17) (2013)
Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii
Polynomial Threshold Functions and Boolean Threshold Circuits. MFCS (2013)
Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. STOC (2012)
Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Deterministic Graphical Games Revisited. J. Log. Comput. 22 (2) (2012)
Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin
Approximating the minmax value of 3-player games within a constant is as hard as detecting planted cliques. Electron. Colloquium Comput. Complex. 19 (2012)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Vladimir V. Podolskii, Elias P. Tsigaridas
Patience of Matrix Games CoRR (2012)
Kristoffer Arnsfelt Hansen, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas
Exact Algorithms for Solving Stochastic Games CoRR (2012)
Kord Eickmeyer, Kristoffer Arnsfelt Hansen, Elad Verbin
Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planted Cliques. SAGT (2012)
Arkadev Chattopadhyay, Ricard Gavaldà, Kristoffer Arnsfelt Hansen, Denis Thérien
Learning Read-Constant Polynomials of Constant Degree Modulo Composites. CSR (2011)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
The Complexity of Solving Reachability Games Using Value and Strategy Iteration. CSR (2011)
Anna Gál, Kristoffer Arnsfelt Hansen, Michal Koucký, Pavel Pudlák, Emanuele Viola
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates. Electron. Colloquium Comput. Complex. 18 (2011)
Kristoffer Arnsfelt Hansen, Michal Koucký, Niels Lauritzen, Peter Bro Miltersen, Elias P. Tsigaridas
Exact algorithms for solving stochastic games: extended abstract. STOC (2011)
Kristoffer Arnsfelt Hansen, Michal Koucký
. Comput. Complex. 19 (2) (2010)
Kristoffer Arnsfelt Hansen, Rasmus Ibsen-Jensen, Peter Bro Miltersen
The complexity of solving reachability games using value and strategy iteration CoRR (2010)
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements. SAGT (2010)
Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii
Exact Threshold Circuits. Computational Complexity Conference (2010)
László Babai, Kristoffer Arnsfelt Hansen, Vladimir V. Podolskii, Xiaoming Sun
Weights of Exact Threshold Functions. MFCS (2010)
Kristoffer Arnsfelt Hansen, Oded Lachish, Peter Bro Miltersen
Hilbert's Thirteenth Problem and Circuit Complexity. ISAAC (2009)
Kristoffer Arnsfelt Hansen, Michal Koucký
. Computational Complexity Conference (2009)
Kristoffer Arnsfelt Hansen, Michal Koucký, Peter Bro Miltersen
Winning Concurrent Reachability Games Requires Doubly-Exponential Patience. LICS (2009)
Kristoffer Arnsfelt Hansen
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates. CSR (2009)
Kristoffer Arnsfelt Hansen
Depth Reduction for Circuits with a Single Layer of Modular Counting Gates. Computational Complexity of Discrete Problems (2008)
Kristoffer Arnsfelt Hansen
Constant Width Planar Branching Programs Characterize ACC^0 in Quasipolynomial Size. Computational Complexity Conference (2008)
Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Approximability and parameterized complexity of minmax values CoRR (2008)
Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Deterministic Graphical Games Revisited. CiE (2008)
Kristoffer Arnsfelt Hansen, Thomas Dueholm Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Approximability and Parameterized Complexity of Minmax Values. WINE (2008)
Gerth Stølting Brodal, Loukas Georgiadis, Kristoffer Arnsfelt Hansen, Irit Katriel
Dynamic Matchings in Convex Bipartite Graphs. MFCS (2007)
Kristoffer Arnsfelt Hansen
Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates. COCOON (2007)
Daniel Andersson, Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Simple Recursive Games CoRR (2007)
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, Troels Bjerre Sørensen
Finding Equilibria in Games of No Chance. COCOON (2007)
Kristoffer Arnsfelt Hansen
Lower Bounds for Circuits with Few Modular Gates using Exponential Sums. Electron. Colloquium Comput. Complex. 13 (079) (2006)
Kristoffer Arnsfelt Hansen
On Modular Counting with Polynomials. Computational Complexity Conference (2006)
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
Circuits on cylinders. Comput. Complex. 15 (1) (2006)
Kristoffer Arnsfelt Hansen
. Theory Comput. Syst. 39 (1) (2006)
Arkadev Chattopadhyay, Kristoffer Arnsfelt Hansen
Lower Bounds for Circuits with Few Modular and Symmetric Gates. ICALP (2005)
Kristoffer Arnsfelt Hansen
. STACS (2004)
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen
Some Meet-in-the-Middle Circuit Lower Bounds. MFCS (2004)
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
Circuits on Cylinders. FCT (2003)
Kristoffer Arnsfelt Hansen
Constant width planar computation characterizes ACC0 Electron. Colloquium Comput. Complex. 10 (025) (2003)
Kristoffer Arnsfelt Hansen, Peter Bro Miltersen, V. Vinay
Circuits on Cylinders Electron. Colloquium Comput. Complex. (066) (2002)