Éva Tardos

About

Éva Tardos is the Jacob Gould Schurman Professor of Computer Science in the Department of Computer Science at Cornell University. She earned her Dipl.Math. in 1981 and Ph.D. in 1984 from Eötvös University, Budapest, Hungary. Her research interests lie in algorithms and algorithmic game theory, a subarea of theoretical computer science focused on designing systems and algorithms for selfish users. Her research focuses on algorithms and games on networks and systems involving strategic behavior of users.

Research topics

• Computer science
• Mathematics
• Mathematical optimization
• Mathematical economics
• Combinatorics

Selected publications

• Calibrated Recommendations for Users with Decaying Attention

  Lecture notes in computer science · 2024-01-01 · 6 citations

  book-chapterSenior author
  PublisherDOI

• Incentives in Dominant Resource Fair Allocation Under Dynamic Demands

  Lecture notes in computer science · 2024-01-01 · 4 citations

  book-chapterSenior author
  PublisherDOI

• Modeling reputation-based behavioral biases in school choice

  arXiv (Cornell University) · 2024-03-07 · 1 citations

  preprintOpen accessSenior author

  A fundamental component in the theoretical school choice literature is the problem a student faces in deciding which schools to apply to. Recent models have considered a set of schools of different selectiveness and a student who is unsure of their strength and can apply to at most $k$ schools. Such models assume that the student cares solely about maximizing the quality of the school that they attend, but experience suggests that students' decisions are also influenced by a set of behavioral bi…

  PublisherOA PDFDOI

• Modeling reputation-based behavioral biases in school choice

  2024-07-08 · 1 citations

  articleSenior author

  A fundamental component in the growing theoretical literature on school choice is the problem a student faces in deciding which schools to apply to. Recent models have considered a setting with a set of schools of different selectiveness, and a student who is unsure of their strength as an applicant and can apply to at most k schools [Ali and Shorrer, 2023]. Such models assume that the student cares solely about maximizing the quality of the school that they will attend. However, experience sugg…

  PublisherDOI

• Robust Equilibria in Shared Resource Allocation via Strengthening Border’s Theorem

  Society for Industrial and Applied Mathematics eBooks · 2026-01-01

  book-chapterSenior author

  We consider repeated allocation of a shared resource via a non-monetary mechanism, wherein a single item must be allocated to one of multiple agents in each round. We assume that each agent has i.i.d. values for the item across rounds, and additive utilities. Past work on this problem has proposed mechanisms where agents can get one of two kinds of guarantees: (\(i\)) (approximate) Bayes-Nash equilibria via linkage-based mechanisms which need extensive knowledge of the value distributions, and (…

  PublisherDOI

Frequent coauthors

• Serge Plotkin

  44 shared

• Vasilis Syrgkanis

  38 shared

• Jon Kleinberg

  Cornell University

  35 shared

• Clifford Stein

  Columbia University

  27 shared

• Tim Roughgarden

  Columbia University

  22 shared

• David B. Shmoys

  Cornell University

  19 shared

• Fillia Makedon

  The University of Texas at Arlington

  17 shared

• Spyros Tragoudas

  Southern Illinois University Carbondale

  17 shared

Labs

• Éva Tardos' labPI

Education

• Other

  Eötvös University

• Ph.D.

  Eötvös University

Awards & honors

• Sloan Research Fellowship (1991)
• Packard Fellowship in Science and Engineering (1995)
• National Academy of Sciences Member (2013)
• National Academy of Engineering Member (2007)
• IEEE John von Neumann Medal (2019)

Similar researchers at Cornell University

• Deborah Estrinh-120
• Wen Sunh-102