• Åbogade 34, 5335, 333

    8200 Aarhus N

    Danmark

20022023

Publikationer pr. år

Filter
Konferencebidrag i proceedings

Søgeresultater

  • 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/proceedingKonferencebidrag i proceedingsForskningpeer review

  • 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/proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
  • 2021

    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/proceedingKonferencebidrag i proceedingsForskningpeer 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/proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
    Fil
    41 Downloads (Pure)
  • Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem

    Batziou, E., Hansen, K. A. & Høgh, K., 2021, 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021). Bansal, N., Merelli, E. & Worrell, J. (red.). Schloss Dagstuhl--Leibniz-Zentrum für Informatik, Bind 198. s. 24:1-24:20 20 s. 24. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 198).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
  • 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.). Schloss Dagstuhl--Leibniz-Zentrum für Informatik, s. 45:1-45:15 15 s. (Leibniz International Proceedings in Informatics, LIPIcs, Bind 170).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
  • 2019

    A Stay-in-a-Set Game without a Stationary Equilibrium

    Hansen, K. A. & Raskin, M., 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/proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
  • 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/proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
  • 2018

    Computational Complexity of Proper Equilibrium

    Hansen, K. A. & Lund, T. B., 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/proceedingKonferencebidrag i proceedingsForskningpeer review

  • 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.). Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, 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/proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
    Fil
    181 Downloads (Pure)
  • The Big Match with a Clock and a Bit of Memory

    Hansen, K. A., Ibsen-Jensen, R. & Neyman, A., 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/proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2017

    Strategy Complexity of Concurrent Safety Games

    Chatterjee, K., Hansen, K. A. & Ibsen-Jensen, R., 2017, 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017). Larsen, K. G., Bodlaender, H. L. & Raskin, J-F. (red.). Dagstuhl, Germany: Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik GmbH, Bind 83. s. 55:1-55:13 13 s. (Leibniz International Proceedings in Informatics; Nr. 83).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
    Fil
    112 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/proceedingKonferencebidrag i proceedingsForskningpeer review

  • 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/proceedingKonferencebidrag i proceedingsForskningpeer review

  • 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/proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
  • 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/proceedingKonferencebidrag i proceedingsForskningpeer review

    Åben adgang
  • 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/proceedingKonferencebidrag i proceedingsForskningpeer review

  • 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/proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2013

    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/proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2012

    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/proceedingKonferencebidrag i proceedingsForskningpeer review

  • 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/proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2007

    Computing Symmetric Boolean Functions by Circuits with Few Exact Threshold Gates

    Hansen, K. A., 2007, Computing and Combinatorics: 13th Annual International Conference, COCOON 2007, Banff, Canada, July 16-19, 2007. Proceedings. Lin, G. (red.). Springer, s. 448-458 11 s. (Lecture Notes in Computer Science, Bind 4598).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  • Dynamic Matchings in Convex Bipartite Graphs

    Brodal, G. S., Georgiadis, L., Hansen, K. A. & Katriel, I., 2007, Proc. 32nd International Symposium on Mathematical Foundations of Computer Science. Kucera, L. & Kucera, A. (red.). Springer, s. 406-417 12 s. (Lecture Notes in Computer Science, Bind 4708).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  • Finding Equilibria in Games of No Chance

    Hansen, K. A., Miltersen, P. B. & Sørensen, T. B., 2007, Computing and Combinatorics: Proc. of 13th Annual International Computing and Combinatorics Conference (COCOON 2007). Lin, G. (red.). Springer, s. 274-284 10 s. (Lecture Notes in Computer Science, Bind 4598).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2006

    On Modular Counting with Polynomials

    Hansen, K. A., 2006, 21st Annual IEEE Conference on Computational Complexity (CCC'06). IEEE Computer Society Press, s. 202-212 8 s.

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2005

    Lower Bounds for Circuits with Few Modular and Symmetric Gates

    Hansen, K. A. & Chattopadhyay, A., 2005, Automata, Languages and Programming: 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005. Proceedings. Caires, L., Italiano, G. F., Monteiro, L., Palamidessi, C. & Yung, M. (red.). Springer, s. 994-1005 12 s. (Lecture Notes in Computer Science, Bind 3580).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2004

    Constant Width Planar Computation Characterizes ACC0

    Hansen, K. A., 2004, STACS 2004: 21st Annual Symposium on Theoretical Aspects of Computer Science, Montpellier, France, March 25-27, 2004. Proceedings. Diekert, V. & Habib, M. (red.). Springer, s. 44-55 12 s. (Lecture Notes in Computer Science, Bind 2996).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  • Some Meet-in-the-middle Circuit Lower Bounds

    Hansen, K. A. & Miltersen, P. B., 2004, Mathematical Foundations of Computer Science 2004: 29th International Symposium, MFCS 2004, Prague, Czech Republic, August 22-27, 2004. Proceedings. Fiala, J., Koubek, V. & Kratochvil, J. (red.). Springer, s. 334-345 12 s. (Lecture Notes in Computer Science, Bind 3153).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review

  • 2003

    Circuits on Cylinders

    Hansen, K. A., Miltersen, P. B. & Vinay, V., 2003, Fundamentals of Computation Theory. Springer, s. 171-182 12 s. (Lecture Notes in Computer Science, Bind 2751).

    Publikation: Bidrag til bog/antologi/rapport/proceedingKonferencebidrag i proceedingsForskningpeer review