Tom WexlerDepartment of Computer ScienceOberlin College  
email: 
tom.wexler "at" oberlin.edu 223 King 10 N. Professor St. Oberlin College Oberlin OH, 44074 

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

PublicationsPlease note that the copyrights on the following papers are owned by their respective copyright holders. Figurative Tours and Braids
Assignment Games with Conflicts: Robust Price of Anarchy and Convergence Results via SemiSmoothness
Computing Shapley Value in Cooperative Supermodular Games
The Price of Civil Society
Mediated Equilibria in LoadBalancing Games
Equilibria and Efficiency Loss in Games on Networks
Strategic Network Formation with Structural Holes.
Network Formation Games.
The Role of Compatibility in the Diffusion of Technologies Through Social Networks.
A Duopoly Pricing Game for Wireless IP Services.
The Effect of Collusion in Congestion Games.
Selfish Behavior in NetworkBased Games.
A Network Pricing Game for Selfish Traffic.
Triangulation and Embedding using Small Sets of Beacons.
The Price of Stability for Network Design with Fair Cost Allocation.
Signed Domination Number of a Graph and its Complement.
NearOptimal Network Design with Selfish Agents.
Facility Location with Hard Capacities.


TeachingAlgorithms (CS 280) 

Past CoursesIntroduction to Computer Science I (CS 150): F09, S10, F10, F12, S13, F13 Algorithms (CS 280): S10, S11, F13. Theory of Computation (CS 383): F10, S13, S14. Game Design (CS 361) F09, F12, F14. 