非常抱歉，
你要访问的页面不存在，
非常抱歉，
你要访问的页面不存在，
非常抱歉，
你要访问的页面不存在，
验证码：
职称:Professor
所属学校:Cornell University
所属院系:College of Engineering
所属专业:Computer Science
联系方式:(607) 255-0984
Algorithms and algorithmic game theory, the subarea of theoretical computer science theory of designing systems and algorithms for selfish users. My research focuses on algorithms and games on networks and simple auctions. I am mostly interested in designing algorithms and games that provide provably close-to-optimal results.
•A. V. Goldberg, E. Tardos, R. E. Tarjan: Network Flow Algorithms, in Paths, Flows and VLSI-Design (eds. B. Korte, L. Lovasz, H.J. Proemel, and A. Schrijver) Springer Verlag, 1990, 101-164. •E. Tardos: Strongly Polynomial and Combinatorial Algorithms in Optimization, in the Proceedings of the International Congress of Mathematicians Kyoto 1990, Springer-Verlag, Tokyo 1991, 1467-1478. •D. B. Shmoys, E. Tardos: Computational Complexity, In the Handbook of Combinatorics (eds. R. Graham, M. Groetschel, and L. Lovasz) North Holland. An extended version has appeared as Technical Report 918, School of Operations Research and Industrial Engineering, Cornell University. •L. Lovasz, D. B. Shmoys and E. Tardos: Combinatorics in Computer Science, In the Handbook of Combinatorics (eds. R. Graham, M. Groetschel, and L. Lovasz) North Holland. •E. Tardos: Approximate Min-Max Theorems and Fast Approximation Algorithms for Multicommodity Flow Problems, annotated bibliography. In Proc. of the Summer School on Combinatorial Optimization, in Maastricht, The Netherlands, Aug. 1993. •E. Tardos: Approximate Min-Max Theorems and Fast Approximation Algorithms for Multicommodity Flow Problems, In Proc. Network Optimization Theory and Practice (NETFLOW), in San Miniato (PI) Italy, Oct. 1993.
