mugshot

Alex Fabrikant

alexf * at * cs.berkeley.edu
+1 (510) 643-5425
581 Soda
Computer Science Division,
UC Berkeley
- CV - Papers - Teaching - Bio -

CV

I am graduating in Summer 2008, and will be heading to Princeton in Fall 2008 for a joint postdoc appointment with Jennifer Rexford's networking group and the Princeton CS theory group. My curriculum vitae is available, but may be outdated.

Papers

  1. Alex Fabrikant and Christos Papadimitriou, The complexity of game dynamics: BGP oscillations, sink equlibria, and beyond, to appear in SODA 2008.
  2. Constantinos Daskalakis, Alex Fabrikant, and Christos Papadimitriou, The Game World is Flat: The Complexity of Nash Equilibria in Succinct Games, In Proc. of ICALP 2006, pages 513-524.
  3. Alex Fabrikant, Christos Papadimitriou, Kunal Talwar, "The Complexity of Pure Nash Equilibria". In Proc. of STOC 2004, pages 604-612.
  4. Alex Fabrikant, Ankur Luthra, Elitza Maneva, Christos H. Papadimitriou, and Scott Shenker, "On a Network Creation Game.". In Proc. of 2003 PODC, pages 347-351.
  5. Alex Fabrikant, Elias Koutsoupias, and Christos H. Papadimitriou, "Heuristically Optimized Trade-offs: A New Paradigm for Power Laws in the Internet". In Proc. of 2002 ICALP, pages 110-122. Springer-Verlag LNCS, 2002.
  6. Alex Fabrikant, Tad Hogg, "Graph Coloring with Quantum Heuristics". In Proc. of 2002 AAAI, pages 22-27. AAAI, 2002.

Teaching

I'm TAing CS70 at Berkeley in Spring 2007. I'm also teaching geometry at San Quentin State Prison as part of the Prison University Project.

Bio

I am a grad student in the CS Theory group at UC Berkeley, working with Christos Papadimitriou on problems in algorithmic game theory, with an emphasis on game dynamics.

At some point, something actually worthy of the word bio might follow here.


Last modified: Sunday, 27-Jul-2008 15:59:58 PDT