Aviad Rubinstein

I am a Computer Science PhD student at UC Berkeley, advised by Christos Papadimitriou. In general, I am interested in Theory of Computer Science (and its applications). Lately, for example, I have been particularly curious about the complexity of equilibria computation, submodular maximization, and dynamic mechanism design. Prior to coming to Berkeley I completed my MSc at Tel-Aviv University with Muli Safra.

Our EconCS Seminar is taking a break this semester (Fall 2014).
See you next semester :)

email:
      aviad [at]eecs.berkeley.edu


Selected publications (more)

  • Aviad Rubinstein: “Inapproximability of Nash equilibrium” (Arxiv; talk slides)
  • Christos Papadimitriou, George Pierrakos, Christos-Alexandros Psomas, Aviad Rubinstein: “The Intractability of Dynamic Mechanism Design” (Arxiv)
  • Adi Livnat, Christos Papadimitriou, Aviad Rubinstein, Andrew Wan: "Satisfiability and Evolution"
    FOCS 2014, to appear. (Arxiv)
  • Abraham Othman, Christos Papadimitriou, Aviad Rubinstein: "The Complexity of Fairness through Equilibrium"
    EC 2014: 209-226. (Arxiv)

Department of Electrical Engineering and Computer Sciences
University of California at Berkeley

Last updated 9/14