- Bio
- Papers
- Teaching -
Bio
I will be travelling until Nov. 5, 2010, with
very limited access to email. Emails may be answered with a 5-7
day delay, and I will not be able to accept any peer
reviewing/refereeing requests until then.
I am a postdoc at Princeton University,
in Jennifer Rexford's
networking group and
the Princeton CS theory
group. In Fall 2010, I will be joining Google Research (Mountain
View) as a Research Scientist.
I received my Ph.D. from UC Berkeley in 2008,
with Christos
H. Papadimitriou as my thesis advisor. My taste in research
problems can be broadly described as "applied CS theory". My ongoing
work and long-term research interests span the Cartesian product of
{algorithmic game theory, complexity, and various algorithmic
techniques} firmly grounded in applications to {networking,
distributed systems, and network security}.
Papers
- Alex Fabrikant, Umar Syed, and Jennifer Rexford, There's
something about MRAI: Timing diversity exponentially worsens BGP
convergence, in submission.
- Submitted version:
[ PDF ]
- Martin Suchara, Alex Fabrikant, and Jennifer Rexford,
BGP Safety with Spurious Updates,
in submission.
- Submitted version:
[ PDF ]
- Technical report (Princeton CS, TR-881-10):
[ PDF ]
- Alex Fabrikant, Aaron Jaggard, and Michael Schapira, On the Structure of Weakly Acyclic Games, to appear in SAGT 2010.
- Minlan Yu, Alex Fabrikant, and Jennifer Rexford,
BUFFALO: Bloom filter forwarding
architecture for large organizations, In Proc. of CoNEXT
2009, pages 313-324.
- Alex Fabrikant, The
Complexity of Game Dynamics, Ph.D. Dissertation, UC Berkeley,
2008.
- Alex Fabrikant and Christos Papadimitriou,
The complexity of game dynamics: BGP oscillations, sink equlibria,
and beyond, In Proc. of SODA 2008, pages 844-853.
- 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.
- Alex Fabrikant, Christos Papadimitriou, and Kunal Talwar, "The Complexity of Pure Nash
Equilibria".
In Proc. of STOC 2004, pages 604-612.
- 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.
- 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.
- Alex Fabrikant, Tad Hogg, "Graph
Coloring with Quantum Heuristics". In Proc. of 2002
AAAI, pages 22-27. AAAI, 2002.
Work in progress
- Alex Fabrikant and Christos Papadimitriou, Best reply with profit
aforethought: lookahead in games and lasso equilibria (provisional
title). An early version of this work appears as section 5.3 of my
dissertation.
...as well as several earlier-stage projects.
Teaching
I have recently:
- Designed and taught a pilot month-long introductory
graduate mini-course on algorithmic game theory at Princeton
(jointly with Xi Chen)
- Designed and taught undergraduate courses on classical geometry
and on chemistry for non-majors as an adjunct instructor at San
Quentin State Prison as part of the Prison University
Project (jointly with Michael Bishop and Adam Booth; and with Chip
Crawford, Erik Douglas, and Micheal Rousseas, respectively)
- TA'ed CS70 (Discrete Math) at Berkeley in
Spring 2007
- TA'ed a number of CS and math courses at UC Berkeley and San
Quentin State Prison, respectively, in previous years
(N.B.: this is my permanent forwarding address)