check
Algorithmic Game Theory: The Next Decade | Israel Institute for Advanced Studies

Algorithmic Game Theory: The Next Decade

[RG # 123] Algorithmic Game Theory: The Next Decade

March 1 - August 31, 2011

Organizers:

Michal Feldman (Tel Aviv University)
Noam Nisan (The Hebrew University)

The last decade has seen the emergence and growth of a new interdisciplinary field of research often termed "Algorithmic Game Theory". This field lies at the crossroads of computer science, game theory, and economics; a combination which is necessary for addressing many of the challenges posed by the Internet. Not only is this field full of intellectual excitement internally, and not only has it already begun to intellectually influence the three parent disciplines, but it also has significant implications for the Internet, as evidenced by the large number of researchers in the field hired by Google, Yahoo, and Microsoft.

At the approximate age of ten years, it seems that the field of Algorithmic Game Theory is maturing. The goal of this group is to elucidate the main challenges of the field and attempt to chart the future course of the field for the next decade.

Some research topics that will be explored:

- Networks with contagious risk, the different aspects of how the evaluation of the Generalized Second Price mechanisms are used for selling ads on the Internet, and the understanding of the performance of simple auctions and modeling auctions used in practice (Eva Tardos)

- Interviewing in stable matching problems and cost-sharing mechanisms (Nicole Immorlica)

- Sketching valuation functions, the equilibria of simple market mechanisms, and optimal multi-item auctions (Noam Nisan)

- Auction design for agents with uncertain, private values (Anna Karlin)

- A general framework for computing optimal correlated equilibria in compact games, computing Nash equilibria of action-graph games via support enumeration, mechanical design and auctions, and computational equilibrium analysis of voting games (Kevin Leyton-Brown)

- Envy-free mechanisms for multiunit auctions with budgets, cost sharing games with capacitated network links, and game theoretic perspectives of the facility location problem (Michal Feldman)

- Bargaining in networks (Amos Fiat)

 

Members

av

Michal Feldman

FELLOW
The Hebrew University of Jerusalem
Michal is a professor in the School of Business Administration and the Center for the Study of Rationality at The Hebrew University of Jerusalem. Her research interests are algorithmic game theory, electronic commerce, and mechanism design.
men

Amos Fiat

FELLOW
Tel Aviv University
Amos is a professor in the School of Computer Science and the School of Mathematical Sciences at Tel Aviv University. His research interests are competitive analysis of online algorithms and computational game theory.
av

Nicole Immorlica

FELLOW
Northwestern University
Nicole is a professor in the Department of Electrical Engineering at Northwestern University. Her research interests are algorithmic game theory, auction design, e-commerce, social networks, approximation algorithms, and network design.
av

Anna Karlin

FELLOW
University of Washington
Anna is a professor in the Department of Computer Science and Engineering at the University of Washington, Seattle.
men

Elias Koutsoupias

FELLOW
University of Athens
Elias is a professor in the Department of Computer Science at the University of Athens. His research interests are theoretical computer science, algorithmic game theory, and decision making under uncertainty.
men

Kevin Leyton-Brown

FELLOW
University of British Columbia
Kevin is a professor in the Department of Computer Science at the University of British Columbia. His research interests are computational game theory; mechanism design and auction theory; and empirical algorithmics.
poster

Noam Nisan

FELLOW
The Hebrew University of Jerusalem
Noam is a professor in the School of Computer Science and Engineering at The Hebrew University of Jerusalem. His research interests are algorithmic game theory, in particular in electronic markets and auctions.
av

Eva Tardos

FELLOW
Cornell University
Eva is a professor in the Department of Computer Science at Cornell University. Her research interests are algorithmic game theory and the design and analysis of algorithms; network problems; combinatorial optimization; approximation algorithms; and the price of anarchy and mechanism design.

Events