Kristoffer Arnsfelt Hansen

91 papers A* 9A 6B 19C 1Misc 6Journal 43Unranked 6

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