Kristoffer Arnsfelt Hansen

ScholarGPS® ID: 38781466800719

Affiliation

Aarhus University, Aarhus, Denmark

Affiliation History

Field

Engineering and Computer Science

Discipline

Computer Science

Top Specialties

Game Theory | Internet | Combinatorics | Composite Material | Logic

Metrics Summary

Publication Count

Predicted Citations

559

Predicted h-index

Ranking

Publications and Citation History

Publications based on Top Specialties

Types of Publication

Publications
Books
Patents
NIH/NSF

Add Delete
PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization (conference) Filos-Ratsikas, Aris \| Hansen, Kristoffer Arnsfelt \| Høgh, Kasper \| Hollender, Alexandros STOC '24: 56th Annual ACM Symposium on Theory of Computing (2024) Vancouver BC Canada 10.1145/3618260.3649645 Cite \| Source
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship (journal article) Caragiannis, Ioannis \| Filos-Ratsikas, Aris \| Frederiksen, Søren Kristoffer Stiil \| Hansen, Kristoffer Arnsfelt \| Tan, Zihan Mathematical Programming, volume 203, issue 1-2, pages 901-930 (2024). 10.1007/s10107-022-01902-8 Cite \| Source
The Big Match with a Clock and a Bit of Memory (journal article) Hansen, Kristoffer Arnsfelt \| Ibsen-Jensen, Rasmus \| Neyman, Abraham Mathematics of Operations Research, volume 48, issue 1, pages 419-432 (2023). 10.1287/moor.2022.1267 Cited by (1) \| Cite \| Source
Computational Complexity of Decision Problems About Nash Equilibria in Win-Lose Multi-player Games (book chapter) In Algorithmic Game Theory Bilò, Vittorio \| Hansen, Kristoffer Arnsfelt \| Mavronicolas, Marios Springer Nature Switzerland (2023) 10.1007/978-3-031-43254-5_3 Cite \| Source
On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria (journal article) Berthelsen, Marie Louisa Tølbøll \| Hansen, Kristoffer Arnsfelt Theory of Computing Systems, volume 66, issue 3, pages 519-545 (2022). 10.1007/s00224-022-10080-1 Cited by (5) \| Cite \| Source
FIXP-membership via Convex Optimization: Games, Cakes, and Markets (conference) Filos-Ratsikas, Aris \| Hansen, Kristoffer Arnsfelt \| Hogh, Kasper \| Hollender, Alexandros 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS) (2022) Denver, CO, USA 10.1109/FOCS52979.2021.00085 Cited by (1) \| Cite \| Source
Web and Internet Economics (book) Springer International Publishing (2022) 10.1007/978-3-031-22832-2 Cite \| Source
Weights of exact threshold functions (journal article) Babai, L. \| Hansen, K. A. \| Podolskii, V. V. \| Sun, Xiaoming Izvestiya: Mathematics, volume 85, issue 6, pages 1039-1059 (2021). 10.1070/IM9113 Cited by (1) \| Cite \| Source
Absorbing games with a clock and two bits of memory (journal article) Hansen, Kristoffer Arnsfelt \| Ibsen-Jensen, Rasmus \| Neyman, Abraham Games and Economic Behavior, volume 128 (2021). 10.1016/j.geb.2021.04.008 Cited by (1) \| Cite \| Source
Persistent symptoms in hospitalized patients recovering from COVID-19 in Denmark (journal article) Leth, Steffen \| Gunst, Jesper Damsgaard \| Mathiasen, Victor \| Hansen, Kristoffer \| Søgaard, Ole \| Østergaard, Lars \| Jensen-Fangel, Søren \| Storgaard, Merete \| Agergaard, Jane Open Forum Infectious Diseases, volume 8, issue 4 (2021). 10.1093/ofid/ofab042 Cited by (40) \| Cite \| Source
Computational Complexity of Multi-player Evolutionarily Stable Strategies (book chapter) In Computer Science – Theory and Applications Blanc, Manon \| Hansen, Kristoffer Arnsfelt Springer International Publishing (2021) 10.1007/978-3-030-79416-3_1 Cited by (2) \| Cite \| Source
Computational Complexity of Computing a Quasi-Proper Equilibrium (book chapter) In Fundamentals of Computation Theory Hansen, Kristoffer Arnsfelt \| Lund, Troels Bjerre Springer International Publishing (2021) 10.1007/978-3-030-86593-1_18 Cite \| Source
Веса точных пороговых функций (journal article) Babai, Laszlo \| Hansen, Kristoffer Arnsfelt \| Podolskii, Vladimir Vladimirovich \| Sun, Xiaoming Известия Российской академии наук. Серия математическая, volume 85, issue 6, pages 5-26 (2021). 10.4213/im9113 Cite \| Source
The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games (journal article) Hansen, Kristoffer Arnsfelt Theory of Computing Systems, volume 63, issue 7, pages 1554-1571 (2019). 10.1007/s00224-018-9887-9 Cited by (5) \| Cite \| Source
A Stay-in-a-Set Game without a Stationary Equilibrium (journal article) Hansen, Kristoffer Arnsfelt \| Raskin, Mikhail Electronic Proceedings in Theoretical Computer Science, volume 305 (2019). 10.4204/EPTCS.305.6 Cited by (2) \| Cite \| Source
On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria (book chapter) In Algorithmic Game Theory Berthelsen, Marie Louisa Tølbøll \| Hansen, Kristoffer Arnsfelt Springer International Publishing (2019) 10.1007/978-3-030-30473-7_11 Cited by (7) \| Cite \| Source
The Big Match with a Clock and a Bit of Memory (conference) Hansen, Kristoffer Arnsfelt \| Ibsen-Jensen, Rasmus \| Neyman, Abraham EC '18: ACM Conference on Economics and Computation (2018) Ithaca NY USA 10.1145/3219166.3219198 Cited by (3) \| Cite \| Source \| Open Access
Computational Complexity of Proper Equilibrium (conference) Hansen, Kristoffer Arnsfelt \| Lund, Troels Bjerre EC '18: ACM Conference on Economics and Computation (2018) Ithaca NY USA 10.1145/3219166.3219199 Cited by (6) \| Cite \| Source
Computation of Stackelberg Equilibria of Finite Sequential Games (journal article) Bošanský, Branislav \| Brânzei, Simina \| Hansen, Kristoffer Arnsfelt \| Lund, Troels Bjerre \| Miltersen, Peter Bro ACM Transactions on Economics and Computation, volume 5, issue 4, pages 1-24 (2017). 10.1145/3133242 Cited by (7) \| Cite \| Source \| Open Access
The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games (book chapter) In Algorithmic Game Theory Hansen, Kristoffer Arnsfelt Springer International Publishing (2017) 10.1007/978-3-319-66700-3_10 Cited by (2) \| Cite \| Source