Alexander Fabrikant, Ph.D.
Affiliations: | 2008 | University of California, Berkeley, Berkeley, CA, United States |
Area:
Biosystems & Computational Biology (BIO); Database Management Systems (DBMS); Theory (THY)Google:
"Alexander Fabrikant"Parents
Sign in to add mentor| Christos Papadimitriou | grad student | 2008 | UC Berkeley | |
| (Complexity of game dynamics.) | ||||
BETA: Related publications
See more...
Publications
|
You can help our author matching system! If you notice any publications incorrectly attributed to this author, please sign in and mark matches as correct or incorrect. |
| Fabrikant A, Jaggard AD, Schapira M. (2013) On the Structure of Weakly Acyclic Games Theory of Computing Systems. 53: 107-122 |
| Fabrikant A, Papadimitriou CH. (2008) The complexity of game dynamics: BGP oscillations, sink equlibria, and beyond Proceedings of the Annual Acm-Siam Symposium On Discrete Algorithms. 844-853 |
| Daskalakis C, Fabrikant A, Papadimitriou CH. (2006) The game world is flat: The complexity of nash equilibria in succinct games Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). 4051: 513-524 |
| Fabrikant A, Papadimitriou C, Talwar K. (2004) The complexity of pure Nash equilibria Conference Proceedings of the Annual Acm Symposium On Theory of Computing. 604-612 |
| Fabrikant A, Luthra A, Maneva E, et al. (2003) On a Network Creation Game Proceedings of the Annual Acm Symposium On Principles of Distributed Computing. 22: 347-351 |