Tom Wexler
 Assistant Professor
 Computer Science
 Oberlin College

Contact

email:    tom.wexler "at" oberlin.edu
office:   223 E King
phone:  (440) 775 8831
hours:   TBA

Teaching (Spring '10)  

Teaching (Fall '09)  

Research 

My research interests include game theory, graph theory, approximation algorithms, social and computer networks, and combinatorics.

Publications

Please note that the copyrights on the following papers are owned by their respective copyright holders.
  • J. Davis, D. Liben-Nowell, A. Sharp, T. Wexler.
    Mediated Equilibria in Load-Balancing Games.
    In Proceedings of WINE '09.

  • J. Davis, Z. Goldman, J. Hilty, E. Koch, D. Liben-Nowell, A. Sharp, T. Wexler, E. Zhou.
    Equilibria and Efficiency Loss in Games on Networks.
    In Proceedings of SocialCom '09.

  • J. Kleinberg, S. Suri, E. Tardos, T. Wexler.
    Strategic Network Formation with Structural Holes.
    In Proceedings of EC '08.
    Also appears in ACM SIGecom Exchanges, Vol. 7, No. 3, Nov. 2008.

  • É. Tardos, T. Wexler.
    Network Formation Games.
    In Algorithmic Game Theory, Ed. N. Nisan, T. Roughgarden, É. Tardos, V. Vazirani. Chapter 19, pages 487-516, Cambridge University Press, 2007.

  • N. Immorlica, J. Kleinberg, M. Mahdian, T. Wexler.
    The Role of Compatibility in the Diffusion of Technologies Through Social Networks.
    In Proceedings of EC '07.

  • H. Inaltekin, T. Wexler, S. Wicker.
    A Duopoly Pricing Game for Wireless IP Services.
    In Proceedings of SECON '07.

  • A. Hayrapetyan, É. Tardos, T. Wexler.
    The Effect of Collusion in Congestion Games.
    In Proceedings of STOC '06.

  • T. Wexler.
    Selfish Behavior in Network-Based Games.
    Ph.D. Thesis. Cornell University, 2005.

  • A. Hayrapetyan, É. Tardos, T. Wexler.
    A Network Pricing Game for Selfish Traffic.
    Distributed Computing March 2007.
    Preliminary version appears in Proceedings of PODC'05.

  • J. Kleinberg, A. Slivkins, T. Wexler.
    Triangulation and Embedding using Small Sets of Beacons.
    Journal of the ACM 2009.
    Preliminary version appears in Proceedings of FOCS '04.

  • E. Anshelevich, A. Dasgupta, J. Kleinberg, E. Tardos, T. Wexler, and T. Roughgarden.
    The Price of Stability for Network Design with Fair Cost Allocation.
    SIAM Journal of Computing, Vol. 38, 4, pp. 1602-1623, 2008.
    Preliminary version appears in Proceedings of FOCS '04.

  • R. Haas, T. Wexler.
    Signed Domination Number of a Graph and its Complement.
    Discrete Mathematics, Vol. 283, Issues 1-3, 2004.

  • E. Anshelevich, A. Dasgupta, É. Tardos, T. Wexler.
    Near-Optimal Network Design with Selfish Agents.
    Theory of Computing, Vol. 4, pp. 77-109, 2008.
    Preliminary version appears in Proceedings of STOC '03.

  • M. Pál, É. Tardos, T. Wexler.
    Facility Location with Hard Capacities.
    In Proceedings of FOCS '01.