Find

For students
For PhDs
For employees

Department of Computer Science

Publications

Sort by: Date | Author | Title

Caragiannis, I. & Hansen, K. A. (Eds.) (2021). Algorithmic Game Theory: 14th International Symposium, SAGT 2021, Aarhus, Denmark, September 21-24, 2021, Proceedings. Springer. Lecture Notes in Computer Science https://doi.org/10.1007/978-3-030-85947-3

Hansen, K. A. & Lund, T. B. (2021). Computational Complexity of Computing a Quasi-Proper Equilibrium. In E. Bampis & A. Pagourtzis (Eds.), Fundamentals of Computation Theory - 23rd International Symposium, FCT 2021, Proceedings: 23rd International Symposium, FCT 2021 Athens, Greece, September 12–15, 2021 Proceedings (pp. 259-271). Springer. https://doi.org/10.1007/978-3-030-86593-1_18

Blanc, M. & Hansen, K. A. (2021). Computational Complexity of Multi-player Evolutionarily Stable Strategies. In R. Santhanam & D. Musatov (Eds.), 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 (pp. 1-17). Springer. https://doi.org/10.1007/978-3-030-79416-31

Caragiannis, I. & Fanelli, A. (2021). On approximate pure Nash equilibria in weighted congestion games with polynomial latencies. Journal of Computer and System Sciences, 117, 40-48. https://doi.org/10.1016/j.jcss.2020.10.007

Caragiannis, I., Kanellopoulos, P. & Kyropoulou, M. (2021). On Interim Envy-Free Allocation Lotteries. In Proceedings of the 22nd ACM Conference on Economics and Computation (EC 2021) (pp. 264-284). Association for Computing Machinery. https://doi.org/10.1145/3465456.3467648

Caragiannis, I., Filos-Ratsikas, A., Kanellopoulos, P. & Vaish, R. (2021). Stable Fractional Matchings. Artificial Intelligence, 295, Article 103416. https://doi.org/10.1016/j.artint.2020.103416

Batziou, E., Hansen, K. A. & Høgh, K. (2021). Strong Approximate Consensus Halving and the Borsuk-Ulam Theorem. In N. Bansal, E. Merelli & J. Worrell (Eds.), 48th International Colloquium on Automata, Languages, and Programming (ICALP 2021) (Vol. 198, pp. 24:1-24:20). Article 24 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.ICALP.2021.24

Caragiannis, I. & Voudouris, A. (2021). The Efficiency of Resource Allocation Mechanisms for Budget-Constrained Users. Mathematics of Operations Research, 46(2), 503-523. https://doi.org/10.1287/moor.2020.1070

Babai, L., Hansen, K. A., Podolskii, V. V. & Sun, X. (2021). Weights of exact threshold functions. Izvestiya: Mathematics, 85(6), 1039-1059. https://doi.org/10.1070/IM9113

Hansen, K. A. & Sølvsten, S. C. (2020). ∃R-completeness of stationary nash equilibria in perfect information stochastic games. In J. Esparza & D. Král (Eds.), 45th International Symposium on Mathematical Foundations of Computer Science, MFCS 2020 (pp. 45:1-45:15). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2020.45

Hansen, K. A. & Raskin, M. (2019). A Stay-in-a-Set Game without a Stationary Equilibrium. In J. Leroux & J.-F. Raskin (Eds.), Proceedings Tenth International Symposium on Games, Automata, Logics, and Formal Verification (Vol. 305, pp. 83-90). Electronic Proceedings in Theoretical Computer Science. https://doi.org/10.4204/EPTCS.305.6

Berthelsen, M. L. T. & Hansen, K. A. (2019). On the Computational Complexity of Decision Problems About Multi-player Nash Equilibria. In D. Fotakis & E. Markakis (Eds.), Algorithmic Game Theory - 12th International Symposium, SAGT 2019, Proceedings (pp. 153-167). Springer VS. https://doi.org/10.1007/978-3-030-30473-7_11

Branzei, S., Orlandi, C. & Yang, G. (2019). Sharing Information with Competitors. In D. Fotakis & E. Markakis (Eds.), Algorithmic Game Theory - 12th International Symposium, SAGT 2019, Proceedings: SAGT 2019 (pp. 34-48). Springer. https://doi.org/10.1007/978-3-030-30473-7

Hansen, K. A. (2019). The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games. Theory of Computing Systems, 63(7), 1554-1571. https://doi.org/10.1007/s00224-018-9887-9

Hansen, K. A. & Lund, T. B. (2018). Computational Complexity of Proper Equilibrium. In É. Tardos, E. Elkind & R. Vohra (Eds.), ACM EC 2018 - Proceedings of the 2018 ACM Conference on Economics and Computation (pp. 113-130). Association for Computing Machinery. https://doi.org/10.1145/3219166.3219199

Dan, C., Hansen, K. A., Jiang, H., Wang, L. & Zhou, Y. (2018). Low rank approximation of binary matrices: Column subset selection and generalizations. In I. Potapov, J. Worrell & P. Spirakis (Eds.), 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018 (Vol. 117, pp. 41:1-41:16). Article 41 Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2018.41

Hansen, K. A., Ibsen-Jensen, R. & Neyman, A. (2018). The Big Match with a Clock and a Bit of Memory. In É. Tardos, E. Elkind & R. Vohra (Eds.), ACM EC 2018 - Proceedings of the 2018 ACM Conference on Economics and Computation (pp. 149-150). Association for Computing Machinery. https://doi.org/10.1145/3219166.3219198

Bosanský, B., Brânzei, S., Hansen, K. A., Lund, T. B. & Miltersen, P. B. (2017). Computation of Stackelberg Equilibria of Finite Sequential Games. A C M Transactions on Economics and Computation, 5(4), 23:1-23:24. Article 23. https://doi.org/10.1145/3133242

Chatterjee, K., Hansen, K. A. & Ibsen-Jensen, R. (2017). Strategy Complexity of Concurrent Safety Games. In K. G. Larsen, H. L. Bodlaender & J.-F. Raskin (Eds.), 42nd International Symposium on Mathematical Foundations of Computer Science (MFCS 2017) (Vol. 83, pp. 55:1-55:13). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2017.55

Hansen, K. A. (2017). The Real Computational Complexity of Minmax Value and Equilibrium Refinements in Multi-player Games. In V. Bilò & M. Flammini (Eds.), Algorithmic Game Theory - 10th International Symposium, SAGT 2017, Proceedings: 10th International Symposium, SAGT 2017 (pp. 119-130). Springer VS. https://doi.org/10.1007/978-3-319-66700-3_10

Brânzei, S., Filos-Ratsikas, A., Miltersen, P. B. & Zeng, Y. (2017). Walrasian pricing in multi-unit auctions. In K. G. Larsen, H. L. Bodlaender & J.-F. Raskin (Eds.), 42nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2017 (Vol. 83, pp. 80:1-80:14). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2017.80

Hansen, K. A., Ibsen-Jensen, R. & Koucký, M. (2016). The big match in small space. In M. Gairing & R. Savani (Eds.), Algorithmic Game Theory - 9th International Symposium, SAGT 2016, Proceedings (Vol. 9928, pp. 64-76). Springer VS. https://doi.org/10.1007/978-3-662-53354-3_6

Caragiannis, I., Filos-Ratsikas, A., Frederiksen, S. K. S., Hansen, K. A. & Tan, Z. (2016). Truthful facility assignment with resource augmentation: An exact analysis of serial dictatorship. In Web and Internet Economics - 12th International Conference, WINE 2016, Proceedings (Vol. 10123, pp. 236-250). Springer VS. https://doi.org/10.1007/978-3-662-54110-4_17

Branzei, S. & Miltersen, P. B. (2015). A Dictatorship Theorem for Cake Cutting. In Q. Yang & M. Wooldridge (Eds.), Proceedings of the Twenty-Fourth International Joint Conference on Artificial Intelligence (IJCAI 2015) (pp. 481-488). AAAI Press. http://ijcai.org/papers15/Papers/IJCAI15-074.pdf

Branzei, S. (2015). A note on envy-free cake cutting with polynomial valuations. Information Processing Letters, 115(2), 93-95. https://doi.org/10.1016/j.ipl.2014.07.005

Branzei, S., Hosseini, H. & Miltersen, P. B. (2015). Characterization and Computation of Equilibria for Indivisible Goods. In Algorithmic Game Theory: 8th International Symposium, SAGT 2015, Saarbrücken, Germany, September 28–30, 2015, Proceedings (pp. 244-255). Springer VS. https://doi.org/10.1007/978-3-662-48433-3_19

Branzei, S. (2015). Computational Fair Division. Department of Computer Science, Aarhus University.

Bosansky, B., Branzei, S., Hansen, K. A., Miltersen, P. B. & Sørensen , T. B. (2015). Computation of Stackelberg Equilibria of Finite Sequential Games. In E. Markakis & G. Schäfer (Eds.), Web and Internet Economics: 11th International Conference, WINE 2015, Amsterdam, The Netherlands, December 9-12, 2015, Proceedings (Vol. 9470, pp. 201-215). Springer VS. http://arxiv.org/abs/1507.07677

Hansen, K. A. & Podolskii, V. V. (2015). Polynomial threshold functions and Boolean threshold circuits. Information and Computation, 240, 56-73. https://doi.org/10.1016/j.ic.2014.09.008

Aziz, H., Branzei, S., Filos-Ratsikas, A. & Frederiksen, S. K. S. (2015). The Adjusted Winner Procedure: Characterizations and Equilibria. Paper presented at International Joint Conference on Artificial Intelligence, Buinos Aires, Argentina.

Branzei, S. & Procaccia, A. D. (2015). Verifiably Truthful Mechanisms. In T. Roughgarden (Ed.), Proceedings of the 2015 Conference on Innovations in Theoretical Computer Science, ITCS '15 (pp. 297-306 ). Association for Computing Machinery. https://doi.org/10.1145/2688073.2688098

Hansen, K. A., Komarath, B., Sarma M. N., J., Talebanfard, N. & Skyum, S. (2014). Circuit Complexity of Properties of Graphs with Constant Planar Cutwidth. In E. Csuhaj-Varjú, M. Dietzfelbinger & Z. Ésik (Eds.), Mathematical Foundations of Computer Science 2014: 39th International Symposium, MFCS 2014, Budapest, Hungary, August 25-29, 2014. Proceedings, Part II (pp. 336-347 ). Springer VS. https://doi.org/10.1007/978-3-662-44465-8_29

Michalak, T. P., Szczepański , P. L., Rahwan, T., Chrobak, A., Branzei, S., Wooldridge, M. & Jennings , N. (2014). Implementation and Computation of a Value for Generalized Characteristic Function Games. A C M Transactions on Economics and Computation, 2(4), Article 16. https://doi.org/10.1145/2665007

Branzei, S. & Miltersen, P. B. (2014). Indirect Revelation Mechanisms for Cake Cutting. Abstract from Economics and Computational Aspects of Game Theory and Social Choice, Warsaw, Poland. http://ecags.mimuw.edu.pl/?m=programme

Chattopadhyay, A., Gavaldà, R., Hansen, K. A. & Thérien, D. (2014). Learning Read-Constant Polynomials of Constant Degree Modulo Composites. Theory of Computing Systems, 55(2), 404-420. https://doi.org/10.1007/s00224-013-9488-6

Miltersen, P. B. (2014). Leibniz International Proceedings in Informatics: Invited talk. Leibniz International Proceedings in Informatics, 25, 11-12. https://doi.org/10.4230/LIPIcs.STACS.2014.11

Miltersen, P. B. (2014). Semi-algebraic geometry in computational game theory - A consumer's perspective: Invited Talk. In E. W. Mayr & N. Portier (Eds.), 31st International Symposium on Theoretical Aspects of Computer Science (STACS 2014) (pp. 11-12). Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.STACS.2014.11

Balkanski, E., Branzei, S., Kurokawa, D. & Procaccia, A. D. (2014). Simultaneous Cake Cutting. In Proceedings of the 28th AAAI Conference on Artificial Intelligence AAAI Press. http://www.aaai.org/ocs/index.php/AAAI/AAAI14/schedConf/presentations

Ackerman, M. & Branzei, S. (2014). The Authorship Dilemma: Alphabetical or Contribution? In A. Bazzan & M. Huhns (Eds.), Proceedings of the 2014 international conference on Autonomous agents and multi-agent systems : AAMAS '14 (pp. 1487-1488). Association for Computing Machinery. http://dl.acm.org/citation.cfm?id=2616025&bnc=1

Etessami, K., Hansen, K. A., Miltersen, P. B. & Sørensen , T. B. (2014). The Complexity of Approximating a Trembling Hand Perfect Equilibrium of a Multi-player Game in Strategic Form. In R. Lavi (Ed.), Algorithmic Game Theory: 7th International Symposium, SAGT 2014, Haifa, Israel, September 30 – October 2, 2014. Proceedings (pp. 231-243 ). Springer VS. https://doi.org/10.1007/978-3-662-44803-8_20

Hansen, K. A., Ibsen-Jensen, R. & Miltersen, P. B. (2014). The Complexity of Solving Reachability Games Using Value and Strategy Iteration. Theory of Computing Systems, 55(2), 380-403. https://doi.org/10.1007/s00224-013-9524-6

Branzei, S., Chen, Y., Deng, X., Filos-Ratsikas, A., Frederiksen, S. K. S. & Zhang, J. (2014). The Fisher Market Game: Equilibrium and Welfare. In Proceedings of the Twenty-Eighth AAAI Conference on Artificial Intelligence (pp. 587-593). AAAI Press. http://www.aaai.org/Library/AAAI/aaai14contents.php

Filos-Ratsikas, A. & Miltersen, P. B. (2014). Truthful Approximations to Range Voting. In T.-Y. Liu, Q. Qi & Y. Ye (Eds.), Web and Internet Economics : 10th Workshop of Internet and Web Economics (WINE), proceedings (pp. 175-188 ). Springer VS. https://doi.org/10.1007/978-3-319-13129-0_13

Hansen, T. D., Ibsen-Jensen, R. & Miltersen, P. B. (2013). A Faster Algorithm for Solving One-Clock Priced Timed Games. In P. R. D*Argenio & H. Melgratti (Eds.), CONCUR 2013 – Concurrency Theory: 24th International Conference, CONCUR 2013, Buenos Aires, Argentina, August 27-30, 2013. Proceedings (pp. 531-545). Springer VS. https://doi.org/10.1007/978-3-642-40184-8_37

Frederiksen, S. K. S. & Miltersen, P. B. (2013). Approximating the Value of a Concurrent Reachability Game in the Polynomial Time Hierarchy. In L. Cai, S.-W. Cheng & T.-W. Lam (Eds.), Algorithms and Computation: 24th International Symposium, ISAAC 2013, Hong Kong, China, December 16-18, 2013, Proceedings (pp. 457-467 ). Springer VS. https://doi.org/10.1007/978-3-642-45030-3_43

Cohen, G., Damgård, I. B., Ishai, Y., Kölker, J., Miltersen, P. B., Raz, R. & Rothblum, R. D. (2013). Efficient multiparty protocols via log-depth threshold formulae. In R. Canetti & J. A. Garay (Eds.), Advances in Cryptology – CRYPTO 2013: 33rd Annual Conference. Proceedings, Part II (pp. 185-202). Springer VS. https://doi.org/10.1007/978-3-642-40084-1_11

Cohen, G., Damgård, I. B., Ishai, Y., Kölker, J., Miltersen, P. B., Raz, R. & Rothblum, R. (2013). Efficient Multiparty Protocols via Log-Depth Threshold Formulae Contact Add Comment RSS-Feed. Electronic Colloquium on Computational Complexity, (TR13-107). http://eccc.hpi-web.de/report/2013/107/

Branzei, S., Caragiannis, I., Kurokawa, D. & Procaccia, A. (2013). Equilibria of Generalized Cut and Choose Protocols. (1307.2225v1 ed.) arxiv.org. http://arxiv.org/abs/1307.2225

Branzei, S. & Miltersen, P. B. (2013). Equilibrium Analysis in Cake Cutting. In M. Gini & O. Shehory (Eds.), Proceedings of the 2013 international conference on Autonomous agents and multi-agent systems , AAMAS '13 (pp. 327-334 ). Association for Computing Machinery. http://dl.acm.org/citation.cfm?id=2484920.2484974&coll=DL&dl=ACM&CFID=340403434&CFTOKEN=84711969

Branzei, S., Procaccia, A. & Zhang, J. (2013). Externalities in Cake Cutting. Proceedings of the International Joint Conference on Artificial Intelligence, 13.

Displaying results 51 to 100 out of 224

2

Sort by: Date | Author | Title

Revised 01.09.2025