Amir Epstein's home page

I am a Ph.D. student at the  Tel-Aviv University studying under the supervision of Prof. Yossi Azar.

Tel: 03-6407439
Fax: 03-6409357

Major interests

  • Online Algorithms
  • Approximation Algorithms
  • Algorithmic Game Theory

Papers published

  • B. Awerbuch, Y. Azar,  A. Epstein, V. Mirrokni and A. Skopalik,

    Fast Convergence to Nearly Optimal Solutions in Potential Games, 

    Proc. of 9th EC (2008). [pdf]

  • A. Epstein, M. Feldman and Y. Mansour, Strong Equilibrium in Cost-Sharing Connection Games,
    Proc. of 8th EC (2007) – Best Student Paper Award. [pdf]
  • A. Epstein, M. Feldman and Y. Mansour, Efficient Graph Topologies in Network Routing Games,
    In Joint Workshop on Economics of Networked Systems and Incentive-Based Computing, 2007.
  • N. Bansal, A. Chakrabarti, A. Epstein, B. Schieber, A Quasi-PTAS for unsplittable flow on line graphs,
    STOC 2006. [ps]
  • Y. Azar and A. Epstein, The hardness of network design for unsplittable flow with selfish users,
    Proc. of 3rd WAOA (2005), 41-54. [ps]
  • Y. Azar and A. Epstein, Convex programming for scheduling unrelated parallel machines,
    Proc. 37th STOC (2005), 331-337. [ps]
  • B. Awerbuch, Y. Azar and A. Epstein, The price of routing unsplittable flow,
    Proc. 37th STOC (2005), 57-66. [ps]
  • Y. Azar, A. Epstein and L. Epstein, Load balancing of temporary tasks in the l_p norm,
    Proc. of 1st WAOA (2003), 53-66.




Office address: Schrieber Building, Open Space, Dept. of Computer Science, School of Computer Science, Tel-Aviv University, Tel-Aviv 69978, Israel.
Phone: 03-6407439