Algorithmic Game Theory

January 10 - 14, 2011

Schedule

All times in this Schedule are Pacific Time (PT)

Monday, January 10, 2011

Morning Session
8:00 - 8:45 Check-In/Light Breakfast (Hosted by IPAM)
8:45 - 9:00 Welcome and Opening Remarks
9:00 - 9:50
Tim Roughgarden (Stanford University)

Smoothness arguments and the price of anarchy

10:00 - 10:15 Break
10:15 - 11:05
Jason Hartline (Northwestern University)

Truth, Envy, and Profit.

11:15 - 11:30 Break
11:30 - 12:20
Vwani Roychowdhury (University of California, Los Angeles (UCLA))

 

12:30 - 2:30 Lunch (on your own)

Afternoon Session
2:30 - 3:20
Vijay Vazirani (Georgia Institute of Technology)

Extending General Equilibrium Theory to the Digital Economy

3:30 - 4:00 Break
4:00 - 4:50
Fan Chung-Graham (University of California, San Diego (UCSD))

Hypergraph coloring games and memoryless voter models

5:00 - 7:00 Reception and Poster Session (Hosted by IPAM)

Tuesday, January 11, 2011

Morning Session
8:00 - 9:00 Continental Breakfast
9:00 - 9:50
Ashish Goel (Stanford University)

Reputation and Trust in Social Networks

10:00 - 10:15 Break
10:15 - 11:05
Aranyak Mehta (Google Inc.)

Online Ad Allocation

11:15 - 11:30 Break
11:30 - 12:20
12:30 - 2:30 Lunch (on your own)

Afternoon Session
2:30 - 3:20
3:30 - 4:00 Break
4:00 - 4:50
Pablo Parrilo (Massachusetts Institute of Technology)

Flow Representations of Games: Near Potential Games and Dynamics


Wednesday, January 12, 2011

Morning Session
8:00 - 9:00 Continental Breakfast
9:00 - 9:50
Rahul Jain (University of Southern California (USC))

Strategic Arrivals into Queueing Networks

10:00 - 10:15 Break
10:15 - 11:05
11:15 - 11:30 Break
11:30 - 12:20
12:30 - 2:30 Lunch (on your own)

Afternoon Session
2:30 - 3:20
Éva Tardos (Cornell University)

Price of Anarchy in Adword Auctions

3:30 - 4:00 Break
4:00 - 4:50
Adam Meyerson (University of California, Los Angeles (UCLA))

Comparing Nash and Correlated Equilibrium Solutions


Thursday, January 13, 2011

Morning Session
8:00 - 9:00 Continental Breakfast
9:00 - 9:50
Edith Elkind (Nanyang Technological University)

Cooperative games with overlapping coalitions.

10:00 - 10:15 Break
10:15 - 11:05
Anna Karlin (University of Washington)

Some observations about prior-free optimal mechanism design in single-parameter environments

11:15 - 11:30 Break
11:30 - 12:20
Randolph McAfee (Yahoo)

Maximally Representative Allocations for Guaranteed Delivery Advertising Campaigns (with Kishore Papineni and Sergei Vassilvitskii)

12:30 - 2:30 Lunch (on your own)

Afternoon Session
2:30 - 3:20
Lance Fortnow (Northwestern University)

Repeated Matching Pennies with Sublinear Randomness

3:30 - 3:45 Break
3:45 - 5:00 Panel Discussion

Friday, January 14, 2011

Morning Session
8:00 - 9:00 Continental Breakfast
9:00 - 9:50
Shuchi Chawla (University of Wisconsin-Madison)

Bayesian Mechanism Design for Budget-Constrained Agents

10:00 - 10:15 Break
10:15 - 11:05
Nicole Immorlica (Northwestern University)

Dueling Algorithms

11:15 - 11:30 Break
11:30 - 12:20
David Kempe (University of Southern California (USC))

Frugal Auctions For Vertex Covers, Flows, and Cuts

12:30 - 1:30 Lunch (on your own)

Afternoon Session
1:45 - 2:35
3:00 - 4:00
Shing-Tung Yau (Harvard University)

The Shape of Inner Space
PDF Presentation
4:00 Reception (Location: IPAM Lobby)