Paul Harrenstein, Dr.
 |
Dr. Paul Harrenstein |
Contact Information
| Dr. Paul Harrenstein | |
| E-Mail: | This email address is being protected from spambots. You need JavaScript enabled to view it. |
| Phone: | +49-89-289-17536 |
| Fax: | +49-89-2180-9338 |
| Office: | Room 01.10.039 Boltzmannstr. 3 85748 Garching |
| Hours: | Tuesdays, 10:00 - 11:00 |
Community Service
Editorial board member of the Journal of AI Research (JAIR)
Publications
H. Aziz, P. Harrenstein, and E. Pyrga. Individual-based stability in hedonic games depending on the best or worst players. In Proceedings of the 11th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), 2012. H. Aziz, M. Brill, F. Fischer, P. Harrenstein, J. Lang, and H. G. Seedig. Possible and necessary winners of partial tournaments. In V. Conitzer and M. Winikoff, editors, Proceedings of the 11th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS). IFAAMAS, 2012. Forthcoming. [ pdf | venue ] H. Aziz, F. Brandt, and P. Harrenstein. Pareto optimality in coalition formation. 2011. Working paper. [ pdf ] H. Aziz, F. Brandt, and P. Harrenstein. Pareto optimality in coalition formation. In G. Persiano, editor, Proceedings of the 4th International Symposium on Algorithmic Game Theory (SAGT), Lecture Notes in Computer Science (LNCS), pages 93-104. Springer-Verlag, 2011. [ link | pdf | venue ] F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. Minimal retentive sets in tournaments. 2011. Working paper. [ pdf ] F. Brandt, F. Fischer, and P. Harrenstein. On the rate of convergence of fictitious play. 2011. Working paper. [ pdf ] F. Brandt and P. Harrenstein. Set-rationalizable choice and self-stability. Journal of Economic Theory, 146(4):1721-1731, 2011. [ link | pdf ] F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. On the complexity of iterated weak dominance in constant-sum games. Theory of Computing Systems, 49(1):162-181, 2011. [ link | pdf ] F. Brandt, F. Fischer, and P. Harrenstein. On the rate of convergence of fictitious play. In E. Koutsoupias and P. Spirakis, editors, Proceedings of the 3rd International Symposium on Algorithmic Game Theory (SAGT), number 6386 in Lecture Notes in Computer Science (LNCS), pages 102-113. Springer-Verlag, 2010. [ link | pdf | venue ] H. Aziz, F. Brandt, and P. Harrenstein. Monotone cooperative games and their threshold versions. In W. van der Hoek, G. A. Kaminka, Y. Lespérance, and M. Luck, editors, Proceedings of the 9th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pages 1017-1024. IFAAMAS, 2010. [ link | pdf | venue ] F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. Minimal retentive sets in tournaments. In W. van der Hoek, G. A. Kaminka, Y. Lespérance, and M. Luck, editors, Proceedings of the 9th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pages 47-54. IFAAMAS, 2010. [ link | pdf | venue ] F. Brandt, F. Fischer, P. Harrenstein, and M. Mair. A computational analysis of the tournament equilibrium set. Social Choice and Welfare, 34(4):597-609, 2010. [ link | pdf ] F. Brandt and P. Harrenstein. Characterization of dominance relations in finite coalitional games. Theory and Decision, 69(2):233-256, 2010. [ link | pdf ] F. Brandt, M. Brill, F. Fischer, P. Harrenstein, and J. Hoffmann. Computing Shapley's saddles. ACM SIGecom Exchanges, 8(2), 2009. [ link | pdf ] F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. On the complexity of iterated weak dominance in constant-sum games. In M. Mavronicolas and V. G. Papadopoulou, editors, Proceedings of the 2nd International Symposium on Algorithmic Game Theory (SAGT), volume 5814 of Lecture Notes in Computer Science (LNCS), pages 287-298. Springer-Verlag, 2009. [ link | pdf | venue ] F. Brandt, M. Brill, F. Fischer, and P. Harrenstein. Computational aspects of Shapley's saddles. In K. S. Decker, J. S. Sichman, C. Sierra, and C. Castelfranchi, editors, Proceedings of the 8th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pages 209-216. IFAAMAS, 2009. [ link | pdf ] F. Brandt, F. Fischer, and P. Harrenstein. The computational complexity of choice sets. Mathematical Logic Quarterly, 55(4):444-459, 2009. [ link | pdf ] F. Brandt, F. Fischer, P. Harrenstein, and Y. Shoham. Ranking games. Artificial Intelligence, 173(2):221-239, 2009. [ link | pdf ] P. Harrenstein, M. M. de Weerdt, and V. Conitzer. A qualitative Vickrey auction. In Proceedings of the 10th ACM Conference on Electronic Commerce (ACM-EC), pages 197-206, 2009. F. Brandt, F. Fischer, P. Harrenstein, and M. Mair. A computational analysis of the tournament equilibrium set. In D. Fox and C. P. Gomes, editors, Proceedings of the 23rd AAAI Conference on Artificial Intelligence (AAAI), pages 38-43. AAAI Press, 2008. [ link | pdf | venue ] F. Brandt, F. Fischer, and P. Harrenstein. The computational complexity of choice sets. In D. Samet, editor, Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge (TARK), pages 82-91. ACM Press, 2007. [ link | pdf | venue ] P. Harrenstein, F. Brandt, and F. Fischer. Commitment and extortion. In M. Huhns and O. Shehory, editors, Proceedings of the 6th International Joint Conference on Autonomous Agents and Multi-Agent Systems (AAMAS), pages 108-115. ACM Press, 2007. [ link | pdf | venue ] F. Brandt, F. Fischer, P. Harrenstein, and Y. Shoham. A game-theoretic analysis of strictly competitive multiagent scenarios. In M. Veloso, editor, Proceedings of the 20th International Joint Conference on Artificial Intelligence (IJCAI), pages 1199-1206, 2007. [ link | pdf | venue ] P. Harrenstein. Logical consequence and the theory of games. Philosophia Scientiae, 8(2), 2004. P. Harrenstein, W. van der Hoek, J.-J. Meyer, and C. Witteveen. A modal characterization of nash equilibrium. Fundamenta Informaticae, 57(2-4), 2004. P. Harrenstein, W. van der Hoek, J.-J. Meyer, and C. Witteveen. On modal interpretations of games. In F. van Harmelen, editor, Proceedings of the 15th European Conference on Artificial Intelligence (ECAI), pages 28-32, 2002. P. Harrenstein, W. van der Hoek, J.-J. Meyer, and C. Witteveen. Boolean games. In J. van Benthem, editor, Proceedings of the 8th Conference on Theoretical Aspects of Rationality and Knowledge (TARK), pages 287-298, 2001.
Courses
WS 2011/12: Computational Social Choice
SS 2011: Algorithmic Game Theory
WS 2010/11: Computational Social Choice
WS 2010/11: Seminar Multiagent Systems