Publikationer pr. år
Publikationer pr. år
Publikation
- 1 - 50 ud af 70 resultater
Søgeresultater
-
2024
On the Complexity of Pareto-Optimal and Envy-Free Lotteries
Caragiannis, I., Hansen, K. A. & Rathi, N., 2024, AAMAS '24: Proceedings of the 23rd International Conference on Autonomous Agents and Multiagent Systems. Association for Computing Machinery, s. 244-252 9 s. (Proceedings of the International Joint Conference on Autonomous Agents and Multiagent Systems, AAMAS).Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
1 Citationer (Scopus) -
PPAD-Membership for Problems with Exact Rational Solutions: A General Approach via Convex Optimization
Filos-Ratsikas, A., Hansen, K. A., Høgh, K. & Hollender, A., jun. 2024, STOC 2024 - Proceedings of the 56th Annual ACM Symposium on Theory of Computing. Mohar, B., Shinkar, I. & O'Donnell, R. (red.). Association for Computing Machinery, Inc., s. 1204-1215 12 s. (Proceedings of the Annual ACM Symposium on Theory of Computing).Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
Åben adgang3 Citationer (Scopus) -
Truthful facility assignment with resource augmentation: an exact analysis of serial dictatorship
Caragiannis, I., Filos-Ratsikas, A., Frederiksen, S. K. S., Hansen, K. A. & Tan, Z., jan. 2024, I: Mathematical Programming. 203, 1-2, s. 901-930 30 s.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review
Åben adgang4 Citationer (Scopus) -
2023
Computational Complexity of Decision Problems About Nash Equilibria in Win-Lose Multi-player Games
Bilò, V., Hansen, K. A. & Mavronicolas, M., sep. 2023, Algorithmic Game Theory: SAGT 2023. Deligkas, A. & Filos-Ratsikas, A. (red.). Cham: Springer, s. 40-57 18 s. (Lecture Notes in Computer Science, Bind 14238).Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
-
The Big Match with a Clock and a Bit of Memory
Hansen, K. A., Ibsen-Jensen, R. & Neyman, A., feb. 2023, I: Mathematics of Operations Research. 48, 1, s. 419-432 14 s.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review
Åben adgangFil2 Citationer (Scopus)3 Downloads (Pure) -
2022
FIXP-membership via Convex Optimization: Games, Cakes, and Markets
Filos-Ratsikas, A., Hansen, K. A., Hogh, K. & Hollender, A., 2022, 2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS). IEEE, s. 827-838 12 s. (Proceedings - Annual IEEE Symposium on Foundations of Computer Science, FOCS).Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
Åben adgang7 Citationer (Scopus) -
On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria
Berthelsen, M. L. T. & Hansen, K. A., jun. 2022, I: Theory of Computing Systems. 66, 3, s. 519-545Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review
6 Citationer (Scopus) -
Web and Internet Economics: 18th International Conference, WINE 2022, Troy, NY, USA, December 12-15, 2022, Proceedings
Hansen, K. A. (Redaktør), Liu, T. X. (Redaktør) & Malekian, A. (Redaktør), dec. 2022, Springer. 376 s. (Lecture Notes in Computer Science, Bind 13778).Publikation: Bog/antologi/rapport › Antologi › Forskning › peer review
-
2021
Absorbing games with a clock and two bits of memory
Hansen, K. A., Ibsen-Jensen, R. & Neyman, A., jul. 2021, I: Games and Economic Behavior. 128, s. 213-230Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review
1 Citationer (Scopus) -
Algorithmic Game Theory: 14th International Symposium, SAGT 2021, Aarhus, Denmark, September 21-24, 2021, Proceedings
Caragiannis, I. (Redaktør) & Hansen, K. A. (Redaktør), 2021, Springer. (Lecture Notes in Computer Science).Publikation: Bog/antologi/rapport › Antologi › Forskning › peer review
-
Computational Complexity of Computing a Quasi-Proper Equilibrium
Hansen, K. A. & Lund, T. B., 2021, Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Proceedings: 23rd International Symposium, FCT 2021 Athens, Greece, September 12–15, 2021 Proceedings. Bampis, E. & Pagourtzis, A. (red.). Cham: Springer, s. 259-271 13 s. (Lecture Notes in Computer Science, Bind 12867).Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
Åben adgang -
Computational Complexity of Multi-player Evolutionarily Stable Strategies
Blanc, M. & Hansen, K. A., 2021, Computer Science – Theory and Applications - 16th International Computer Science Symposium in Russia, CSR 2021, Proceedings: 16th International Computer Science Symposium in Russia, CSR 2021, Sochi, Russia, June 28–July 2, 2021, Proceedings. Santhanam, R. & Musatov , D. (red.). Springer, s. 1-17 17 s. (Lecture Notes in Computer Science, Bind 12730).Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
Åben adgangFil3 Citationer (Scopus)80 Downloads (Pure) -
Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem
Batziou, E., Hansen, K. A. & Høgh, K., 1 jul. 2021, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Bansal, N., Merelli, E. & Worrell, J. (red.). Dagstuhl Publishing, Bind 198. s. 24:1-24:20 20 s. 24. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 198).Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
Åben adgang7 Citationer (Scopus) -
Weights of exact threshold functions
Babai, L., Hansen, K. A., Podolskii, V. V. & Sun, X., nov. 2021, I: Izvestiya: Mathematics. 85, 6, s. 1039-1059 21 s.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review
1 Citationer (Scopus) -
2020
∃R-completeness of stationary nash equilibria in perfect information stochastic games
Hansen, K. A. & Sølvsten, S. C., 2020, 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020. Esparza, J. & Král, D. (red.). Dagstuhl Publishing, s. 45:1-45:15 15 s. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 170).Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
Åben adgang -
2019
A Stay-in-a-Set Game without a Stationary Equilibrium
Hansen, K. A. & Raskin, M., 18 sep. 2019, Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification. Leroux, J. & Raskin, J.-F. (red.). Electronic Proceedings in Theoretical Computer Science, Bind 305. s. 83-90 8 s.Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
Åben adgang3 Citationer (Scopus) -
On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria
Berthelsen, M. L. T. & Hansen, K. A., 2019, Algorithmic Game Theory - 12th International Symposium, SAGT 2019, Proceedings. Fotakis, D. & Markakis, E. (red.). Cham: Springer VS, s. 153-167 15 s. (Lecture Notes in Computer Science, Bind 11801).Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
Åben adgang8 Citationer (Scopus) -
The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games
Hansen, K. A., okt. 2019, I: Theory of Computing Systems. 63, 7, s. 1554-1571Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review
Åben adgangFil6 Citationer (Scopus)142 Downloads (Pure) -
2018
Computational Complexity of Proper Equilibrium
Hansen, K. A. & Lund, T. B., 11 jun. 2018, ACM EC 2018 - Proceedings of the 2018 ACM Conference on Economics and Computation. Tardos, É., Elkind, E. & Vohra, R. (red.). New York, NY, USA : Association for Computing Machinery, s. 113-130 18 s.Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
8 Citationer (Scopus) -
Low rank approximation of binary matrices: Column subset selection and generalizations
Dan, C., Hansen, K. A., Jiang, H., Wang, L. & Zhou, Y., 2018, 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018. Potapov, I., Worrell, J. & Spirakis, P. (red.). Dagstuhl Publishing, Bind 117. s. 41:1-41:16 16 s. 41. (Leibniz International Proceedings in Informatics; Nr. 117).Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
Åben adgangFil8 Citationer (Scopus)160 Downloads (Pure) -
The Big Match with a Clock and a Bit of Memory
Hansen, K. A., Ibsen-Jensen, R. & Neyman, A., 11 jun. 2018, ACM EC 2018 - Proceedings of the 2018 ACM Conference on Economics and Computation. Tardos, É., Elkind, E. & Vohra, R. (red.). Ithaca, NY, USA: Association for Computing Machinery, s. 149-150 2 s.Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
4 Citationer (Scopus) -
2017
Computation of Stackelberg Equilibria of Finite Sequential Games
Bosanský, B., Brânzei, S., Hansen, K. A., Lund, T. B. & Miltersen, P. B., 22 dec. 2017, I: A C M Transactions on Economics and Computation. 5, 4, s. 23:1-23:24 24 s., 23.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review
13 Citationer (Scopus) -
Strategy Complexity of Concurrent Safety Games
Chatterjee, K., Hansen, K. A. & Ibsen-Jensen, R., 1 nov. 2017, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Larsen, K. G., Bodlaender, H. L. & Raskin, J.-F. (red.). Dagstuhl, Germany: Dagstuhl Publishing, Bind 83. s. 55:1-55:13 13 s. (Leibniz International Proceedings in Informatics; Nr. 83).Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
Åben adgangFil5 Citationer (Scopus)87 Downloads (Pure) -
The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games
Hansen, K. A., 1 jan. 2017, Algorithmic Game Theory - 10th International Symposium, SAGT 2017, Proceedings: 10th International Symposium, SAGT 2017. Bilò, V. & Flammini, M. (red.). Cham: Springer VS, s. 119-130 12 s. (Lecture Notes in Computer Science, Bind 10504).Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
3 Citationer (Scopus) -
2016
The big match in small space
Hansen, K. A., Ibsen-Jensen, R. & Koucký, M., 2016, Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Proceedings. Gairing, M. & Savani , R. (red.). Springer VS, Bind 9928. s. 64-76 13 s. (Lecture Notes in Computer Science, Bind 9928).Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
3 Citationer (Scopus) -
Truthful facility assignment with resource augmentation: An exact analysis of serial dictatorship
Caragiannis, I., Filos-Ratsikas, A., Frederiksen, S. K. S., Hansen, K. A. & Tan, Z., 2016, Web and Internet Economics - 12th International Conference, WINE 2016, Proceedings. Springer VS, Bind 10123. s. 236-250 15 s. (Lecture Notes in Computer Science, Bind 10123).Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
Åben adgang16 Citationer (Scopus) -
2015
Computation of Stackelberg Equilibria of Finite Sequential Games
Bosansky, B., Branzei, S., Hansen, K. A., Miltersen, P. B. & Sørensen , T. B., 2015, Web and Internet Economics: 11th International Conference, WINE 2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings. Markakis, E. & Schäfer, G. (red.). Springer VS, Bind 9470. s. 201-215 15 s. (Lecture Notes in Computer Science).Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
Åben adgang1 Citationer (Scopus) -
Polynomial threshold functions and Boolean threshold circuits
Hansen, K. A. & Podolskii, V. V., 2015, I: Information and Computation. 240, s. 56-73 18 s.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review
17 Citationer (Scopus) -
2014
Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth
Hansen, K. A., Komarath, B., Sarma M. N., J., Talebanfard, N. & Skyum, S., 2014, Mathematical Foundations of Computer Science 2014: 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II. Csuhaj-Varjú, E., Dietzfelbinger, M. & Ésik, Z. (red.). Springer VS, s. 336-347 12 s. (Lecture Notes in Computer Science, Bind 8635).Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
1 Citationer (Scopus) -
Learning Read-Constant Polynomials of Constant Degree Modulo Composites
Chattopadhyay, A., Gavaldà, R., Hansen, K. A. & Thérien, D., 2014, I: Theory of Computing Systems. 55, 2, s. 404-420 17 s.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review
1 Citationer (Scopus) -
The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form
Etessami, K., Hansen, K. A., Miltersen, P. B. & Sørensen , T. B., jun. 2014, Algorithmic Game Theory: 7th International Symposium, SAGT 2014, Haifa, Israel, September 30 – October 2, 2014. Proceedings. Lavi, R. (red.). Springer VS, s. 231-243 13 s. (Lecture Notes in Computer Science, Bind 8768).Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
6 Citationer (Scopus) -
The Complexity of Solving Reachability Games Using Value and Strategy Iteration
Hansen, K. A., Ibsen-Jensen, R. & Miltersen, P. B., 1 jan. 2014, I: Theory of Computing Systems. 55, 2, s. 380-403 24 s.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review
8 Citationer (Scopus) -
2013
Patience of matrix games
Hansen, K. A., Ibsen-Jensen, R., Podolskii, V. V. & Tsigaridas, E., 2013, I: Discrete Applied Mathematics. 161, 16-17, s. 2440–2459 20 s.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review
-
Polynomial threshold functions and Boolean threshold circuits
Hansen, K. A. & Podolskii, V. V., 2013, I: Electronic Colloquium on Computational Complexity. TR13-021, 25 s.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review
-
Polynomial threshold functions and Boolean threshold circuits
Hansen, K. A. & Podolskii, V. V., 2013, Mathematical Foundations of Computer Science 2013: 38th International Symposium, MFCS 2013, Klosterneuburg, Austria, August 26-30, 2013. Proceedings. Chatterjee, K. & Sgall , J. (red.). Springer VS, s. 516-527 12 s. (Lecture Notes in Computer Science, Bind 8087).Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
4 Citationer (Scopus) -
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
Gal, A., Hansen, K. A., Koucky, M., Pudlak, P. & Viola, E., 1 jan. 2013, I: I E E E Transactions on Information Theory. 59, 10, s. 6611-6627 17 s.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review
11 Citationer (Scopus) -
2012
Approximating the minmax value of 3-player games within a constant is as hard as detecting planted cliques
Eickmeyer, K., Hansen, K. A. & Verbin, E., 2012, I: Electronic Colloquium on Computational Complexity. TR12-25, 22 s.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review
-
Approximating the minmax value of Three-player games within a constant is as hard as detecting planted cliques
Eickmeyer, K., Hansen, K. A. & Verbin, E., 2012, I: Lecture Notes in Computer Science. 7615, s. 96-107 12 s.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Konferenceartikel › Forskning › peer review
-
Deterministic Graphical Games Revisited
Andersson, K. O. D., Hansen, K. A., Miltersen, P. B. & Sørensen, T. B., 2012, I: Journal of Logic and Computation. 22, 2, s. 165-178 14 s.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review
7 Citationer (Scopus) -
Exact Algorithms for Solving Stochastic Games
Hansen, K. A., Koucky, M., Lauritzen, N., Miltersen, P. B. & Tsigaridas, E., 2012, 34 s.Publikation: Working paper/Preprint › Working paper › Forskning
-
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
Gál , A., Hansen, K. A., Koucký, M., Pudlák, P. & Viola, E., 2012, STOC '12 Proceedings of the 44th symposium on Theory of Computing . Karloff, H. & Pitassi, T. (red.). Association for Computing Machinery, s. 479-494 15 s.Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
6 Citationer (Scopus) -
2011
Exact algorithms for solving stochastic games
Hansen, K. A., Koucký, M., Lauritzen, N., Miltersen, P. B. & Tsigaridas, E., 2011, STOC'11: proceedings of the 43rd annual ACM symposium on Theory of computing. New York: Association for Computing Machinery, s. 205-214 10 s.Publikation: Bidrag til bog/antologi/rapport/proceeding › Konferencebidrag i proceedings › Forskning › peer review
35 Citationer (Scopus) -
Learning Read-constant Polynomials of Constant Degree modulo Composites
Chattopadhyay, A., Gavaldá, R., Hansen, K. A. & Thérien, D., 2011, I: Lecture Notes in Computer Science. 6651, s. 29-42 14 s.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Konferenceartikel › Forskning › peer review
1 Citationer (Scopus) -
Separation bounds for real roots of polynomial systems
Hansen, K. A., Koucky, M., Lauritzen, N. & Tsigaridas, E., 2011.Publikation: Konferencebidrag › Paper › Forskning › peer review
-
The complexity of solving reachability games using value and strategy iteration
Hansen, K. A., Miltersen, P. B. & Ibsen-Jensen, R., 2011, I: Lecture Notes in Computer Science. 6651, s. 77-90 14 s.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Konferenceartikel › Forskning › peer review
16 Citationer (Scopus) -
Tight bounds on computing error-correcting codes by bounded-depth circuits with arbitrary gates
Gál, A., Hansen, K. A., Koucký, M., Pudlák, P. & Viola, E., 2011, I: Electronic Colloquium on Computational Complexity. 18, 150, 33 s.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review
-
2010
A New Characterization of ACC0 and Probabilistic CC0
Hansen, K. A. & Koucký, M., 2010, I: Computational Complexity. 19, 2, s. 211-234 24 s.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Tidsskriftartikel › Forskning › peer review
12 Citationer (Scopus) -
Exact Threshold Circuits
Hansen, K. A. & Podolskii, V. V., 2010, I: I E E E Conference on Computational Complexity. Proceedings. s. 270-279 10 s.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Konferenceartikel › Forskning › peer review
24 Citationer (Scopus) -
The computational complexity of trembling hand perfection and other equilibrium refinements
Hansen, K. A., Miltersen, P. B. & Sørensen, T. B., 2010, I: Lecture Notes in Computer Science. 6386, s. 198-209 12 s.Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Konferenceartikel › Forskning › peer review
20 Citationer (Scopus) -
Weights of Exact Threshold Functions
Babai, L., Hansen, K. A., Podolskii, V. V. & Sun, X., 2010, I: Lecture Notes in Computer Science. 6281, s. 66-77Publikation: Bidrag til tidsskrift/Konferencebidrag i tidsskrift /Bidrag til avis › Konferenceartikel › Forskning › peer review
13 Citationer (Scopus)