Schedule for Eva Tardos' Visit

Thursday, Oct. 29:
To arrange a meeting, please contact Christian Scheideler

Topic of the talk: Approximation Algorithms and Games on Networks

In this talk we discuss work at the intersection of algorithms design and game theory. Traditional algorithms design assumes that the problem is described by a single objective function. One of the main current trends of work focuses on approximation algorithms, where computing the exact optimum is too hard. However, there is an additional difficulty in a number of settings. It is natural to consider algorithmic questions where multiple agents each pursue their own selfish interests. We will discuss problems and results that arise from this perspective.

Eva Tardos studied mathematics at Eötvös University in Budapest, Hungary, and received her Ph.D. in mathematics there in 1984. After teaching at Eötvös and the MIT, she joined Cornell in 1989. She is a member of the American Academy of Arts and Sciences, an ACM Fellow, was a Guggenheim Fellow, and a David and Lucille Packard Fellow in Science and Engineering, and has received the Fulkerson Prize (awarded jointly by the American Mathematical Society and the Mathematical Programming Society). She is the editor of several journals. Her research interest focuses on the design and analysis of efficient methods for combinatorial optimization problems on graphs or networks. Such problems arise in many applications such as vision, and the design, maintenance, and management of communication networks. She is mostly interested in fast combinatorial algorithms that provide provably optimal or close-to-optimal results.
Last modified: Oct 8 2001