|
Earlier publications on agent communication and autonomy are available upon request.
|
|
Copyright Notice: All material on this page is copyright by the authors or other copyright holders. Permission to make digital or hard copies of part or all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and bear the full citation and a possible copyright notice on the first page. To copy otherwise, to republish, to post on servers, or to redistribute to lists, requires prior specific permission and/or a fee. In particular, work published in the Springer LNCS Series is © Springer-Verlag.
|
|
| Preprints |
|
|
F. Brandt, M. Brill, F. Fischer, and P. Harrenstein.
Minimal retentive sets in tournaments.
2009.
Working paper.
[ .pdf |
.ps.gz ]
|
|
|
N. Alon, F. Fischer, A. D. Procaccia, and M. Tennenholtz.
Sum of us: Strategyproof selection from the selectors.
2009.
arXiv:0910.4699. Working paper.
[ .pdf |
.ps.gz |
report ]
|
|
|
F. Brandt, F. Fischer, P. Harrenstein, and M. Mair.
A computational analysis of the tournament equilibrium set.
Social Choice and Welfare, 2009.
Forthcoming.
[ .pdf |
.ps.gz |
link ]
|
|
|
D. Baumeister, F. Brandt, F. Fischer, J. Hoffmann, and J. Rothe.
The complexity of computing minimal unidirectional covering
sets.
2009.
arXiv:0901.3692. Working paper.
[ .pdf |
.ps.gz |
report ]
|
|
|
F. Brandt, F. Fischer, and M. Holzer.
On iterated dominance, matrix elimination, and matched paths.
ECCC Report TR08-077, Electronic Colloquium on Computational
Complexity (ECCC), 2008.
Working paper.
[ .pdf |
.ps.gz |
report ]
|
| | | 2009 |
|
|
F. Fischer.
Complexity results for some classes of strategic games.
Dissertation, Fakultät für Mathematik, Informatik und
Statistik, Ludwig-Maximilians-Universität München, 2009.
[ .pdf |
.ps.gz |
link |
slides ]
|
|
|
F. Brandt, M. Brill, F. Fischer, and J. Hoffmann.
The computational complexity of weak saddles.
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 238–249.
Springer-Verlag, 2009.
[ .pdf |
.ps.gz |
link |
venue ]
|
|
|
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.
[ .pdf |
.ps.gz |
link |
venue ]
|
|
|
F. Fischer, A. D. Procaccia, and A. Samorodnitsky.
A new perspective on implementation by voting trees.
In Proceedings of the 10th ACM Conference on Electronic Commerce
(ACM-EC), 2009.
Supersedes ”On Voting Caterpillars: Approximating Maximum Degree in
a Tournament by Binary Trees”, Technical Report 2008-06, Leibniz Center for
Research in Computer Science, The Hebrew University of Jerusalem. Also
presented at the 2nd International Workshop on Computational Social Choice
(COMSOC).
[ .pdf |
.ps.gz |
report |
slides |
venue |
venue ]
|
|
|
F. Brandt, F. Fischer, and P. Harrenstein.
The computational complexity of choice sets.
Mathematical Logic Quarterly, 55(4):444–459, 2009.
Earlier version appeared in the Proceedings of the 11th Conference on
Theoretical Aspects of Rationality and Knowledge (TARK). Also presented at
the 1st International Workshop on Computational Social Choice (COMSOC).
[ .pdf |
.ps.gz |
link ]
|
|
|
F. Brandt, M. Brill, F. Fischer, and P. Harrenstein.
Computational aspects of Shapley's saddles.
In K. S. Decker and J. S. Sichman, editors, Proceedings of the
8th International Joint Conference on Autonomous Agents and Multi-Agent
Systems (AAMAS), 2009.
[ .pdf |
.ps.gz |
link |
venue ]
|
|
|
F. Brandt, F. Fischer, and M. Holzer.
Symmetries and the complexity of pure Nash equilibrium.
Journal of Computer and System Sciences, 75(3):163–177, 2009.
Earlier version appeared in the Proceedings of the 24th International
Symposium on Theoretical Aspects of Computer Science (STACS).
[ .pdf |
.ps.gz |
link |
slides ]
|
|
|
F. Brandt, F. Fischer, P. Harrenstein, and Y. Shoham.
Ranking games.
Artificial Intelligence, 173(2):221–239, 2009.
Revised and extended version of the AAAI 2006 and IJCAI 2007 papers
titled ”On Strictly Competitive Multi-Player Games” and ”A Game-Theoretic
Analysis of Strictly Competitive Multiagent Scenarios”.
[ .pdf |
.ps.gz |
link ]
|
| | | 2008 |
|
|
F. Brandt, F. Fischer, and M. Holzer.
Equilibria of graphical games with symmetries.
In C. H. Papadimitriou and S. Zhang, editors, Proceedings of the
4th International Workshop on Internet and Network Economics (WINE), Lecture
Notes in Computer Science (LNCS), pages 198–209. Springer-Verlag, 2008.
Earlier version published as ECCC Report TR07-136.
[ .pdf |
.ps.gz |
link |
report |
venue ]
|
|
|
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.
Supersedes ”Recognizing Members of the Tournament Equilibrium Set is
NP-hard” by Brandt, Fischer, and Harrenstein, arXiv:0711.2961. Also
presented at the 2nd International Workshop on Computational Social Choice
(COMSOC).
[ newer version |
report |
venue |
venue ]
|
|
|
F. Brandt and F. Fischer.
Computing the minimal covering set.
Mathematical Social Sciences, 56(2):254–268, 2008.
Revised and extended version of a AAAI 2007 paper titled
”Computational Aspects of Covering in Dominance Graphs”, also presented at
the 5th International Conference on Logic, Game Theory and Social Choice
(LGS).
[ .pdf |
.ps.gz |
link |
slides ]
|
|
|
F. Brandt and F. Fischer.
On the hardness and existence of quasi-strict equilibria.
In B. Monien and U.-P. Schroeder, editors, Proceedings of the
1st International Symposium on Algorithmic Game Theory (SAGT), volume 4997
of Lecture Notes in Computer Science (LNCS), pages 291–302.
Springer-Verlag, 2008.
[ .pdf |
.ps.gz |
link |
slides |
venue ]
|
|
|
O. Dekel, F. Fischer, and A. D. Procaccia.
Incentive compatible regression learning.
In S.-H. Teng, editor, Proceedings of the 19th Annual ACM-SIAM
Symposium on Discrete Algorithms (SODA), pages 884–893. SIAM, 2008.
Earlier version presented at the Dagstuhl Seminar on Computational
Social Systems and the Internet and published as Leibniz Center Technical
Report 2007-112.
[ .pdf |
.ps.gz |
link |
report |
slides |
venue ]
|
| | | 2007 |
|
|
F. Brandt and F. Fischer.
PageRank as a weak tournament solution.
In X. Deng and F. Chung Graham, editors, Proceedings of the
3rd International Workshop on Internet and Network Economics (WINE), volume
4858 of Lecture Notes in Computer Science (LNCS), pages 300–305.
Springer-Verlag, 2007.
[ .pdf |
.ps.gz |
link |
venue ]
|
|
|
F. Brandt and F. Fischer.
Computational aspects of covering in dominance graphs.
In R. C. Holte and A. Howe, editors, Proceedings of the 22nd
AAAI Conference on Artificial Intelligence (AAAI), pages 694–699. AAAI
Press, 2007.
Also presented at the 5th International Conference on Logic, Game
Theory and Social Choice (LGS).
[ newer version |
link |
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.
Earlier version presented at the 1st International Workshop on
Computational Social Choice (COMSOC).
[ newer version |
link |
venue |
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.
[ .pdf |
.ps.gz |
link |
venue ]
|
|
|
F. Brandt, F. Fischer, and M. Holzer.
Symmetries and the complexity of pure Nash equilibrium.
In W. Thomas and P. Weil, editors, Proceedings of the 24th
International Symposium on Theoretical Aspects of Computer Science (STACS),
volume 4393 of Lecture Notes in Computer Science (LNCS), pages
212–223. Springer-Verlag, 2007.
Earlier version presented at the 17th International Conference on
Game Theory and published as ECCC Report TR06-091.
[ newer version |
link |
report |
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.
[ newer version |
link |
slides |
venue ]
|
| | | 2006 |
|
|
F. Brandt, F. Fischer, and Y. Shoham.
On strictly competitive multi-player games.
In Y. Gil and R. Mooney, editors, Proceedings of the 21st
National Conference on Artificial Intelligence (AAAI), pages 605–612. AAAI
Press, 2006.
Also presented at the 17th International Conference on Game Theory.
[ newer version |
link |
venue ]
|
|
|
F. Fischer, M. Holzer, and S. Katzenbeisser.
The influence of neighbourhood and choice on the complexity of
finding pure Nash equilibria.
Information Processing Letters, 99(6):239–245, 2006.
[ .pdf |
.ps.gz |
link |
slides ]
|
|
This bibliography has been generated by
bibtex2html. |
|
