Elliot Anshelevich received his Ph.D. from Cornell University under the supervision of Jon Kleinberg in 2005. His research interests include network design problems, algorithmic game theory, local and decentralized routing algorithms, approximation algorithms, and information propagation in both social and computer networks. He is particularly interested in a range of problems defined on large decentralized networks, especially those involving strategic agents. Elliot lives in Troy, NY, where he has been a faculty member of the RPI CS department since 2006.

Anirban did his undergraduate studies at the Computer Science department of IIT Kharagpur, and joined the Cornell CS department as a graduate student in 2000. After finishing his PhD in 2006 under the supervision of John Hopcroft, he joined Yahoo Research. Anirban's research interests span linear algebraic techniques for information retrieval, algorithmic game theory, modeling of and algorithms for social networks and the design and analysis of randomized and approximation algorithms in general.

Éva Tardos received her Ph.D. in 1984 from Eötvös University Budapest under András Frank. Her research interests include algorithms and algorithmic game theory. She has been elected to the National Academy of Engineering and the American Academy of Arts and Sciences. Her other major interests are her kids Rebecca and Amy.

Tom Wexler recieved his Ph.D. from Cornell University in 2005 under the supervision of Éva Tardos. He joined the Mathematics and Computer Science Department at Denison University in the fall of 2007. His research focuses primarily on approximation algorithms, game theory, graph theory, and the study of large-scale and social networks. Other interests include teaching, drawing, painting, puzzles and games.