Bay Algorithmic Game Theory Symposium
Meeting 3: April 20, 2007, 10am-5:30pm, Room 101, Allen Center for Integrated Systems, Stanford U.

[Home] [Schedule] [Abstracts] [Organizers] [Next Meeting]

[BAGT 1] [BAGT 2] [BAGT 3] [BAGT 4] [BAGT 5] [BAGT 6]

Schedule

10:00-10:30 Arrivals, Registration, Coffee, and Breakfast
10:30-11:00 Talk: Constantinos Daskalakis "Computing Approximate Equilibrium Points"
11:00-11:30 Talk: Adam Szeidl "Optimal Risksharing Contracts in Social Networks"
11:30-12:00 Talk: Gagan Aggarwal "Position-based Keyword Auctions"
12:00-1:30 Lunch (provided)
1:30-2:00 Talk: Michael Ostrovsky "Stability in Supply Chain Networks"
2:00-2:30 Talk: Yoav Shoham "Pushing the envelope: New research topics at the interface of computer science and game theory"
2:30-3:00 Mini TalksKenneth Judd, Hamid Nazerzadeh, Mukund Sundararajan, and Kunal Talwar
3:00-4:00 Coffee Break
4:00-4:30 Talk: Mohammad Mahdian "The role of compatibility in the diffusion of technologies in social networks"
4:30-5:00 Talk: Paul Milgrom "Incentives in Core-Selecting Mechanisms"
5:30-7:30 Dinner at local restaurants (not provided).

Abstracts

Gagan Aggarwal, "Position-based keyword auctions" [ppt]: Konstantinos Daskalakis, "Computing Approximate Equilibrium Points" [ppt]: Mohammad Mahdian, "The role of compatibility in the diffusion of technologies in social networks" [ppt]: Paul Milgrom, "Incentives in Core-Selecting Mechanisms" [pdf]: Michael Ostrovsky, "Stability in Supply Chain Networks" [pdf]: Yoav Shoham, "Pushing the envelope: New research topics at the interface of computer science and game theory" [ppt]: Adam Szeidl, "Optimal Risksharing Contracts in Social Networks" [pdf]:

Organizers

Moshe BabaioffUC Berkeley
Jason HartlineMicrosoft Research
Tim RoughgardenStanford U.
Ilya SegalStanford U.