Algorithmic Game Theory - IPAM

Algorithmic Game Theory

January 10 - 14, 2011

Schedule

All times in this Schedule are Pacific Time (PT)

Monday, January 10, 2011

Morning Session

08:00-08:45
Check-In/Light Breakfast (Hosted by IPAM)
08:45-09:00
Welcome and Opening Remarks
09:00-09: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))
Title not available

Afternoon Session

12:30-14:30
Lunch (on your own)
14:30-15:20
Vijay Vazirani (Georgia Institute of Technology)
Extending General Equilibrium Theory to the Digital Economy
15:30-16:00
Break
16:00-16:50
Fan Chung-Graham (University of California, San Diego (UCSD))
Hypergraph coloring games and memoryless voter models
17:00-19:00
Reception and Poster Session (Hosted by IPAM)

Tuesday, January 11, 2011

Morning Session

08:00-09:00
Continental Breakfast
09:00-09: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
De Liu (University of Kentucky)
Information Asymmetry and Payment Schemes in Online Advertising

Afternoon Session

12:30-14:30
Lunch (on your own)
14:30-15:20
Michael Schwarz (Yahoo! Research)
Reserve Prices in Internet Advertising Auctions: A Field Experiment
15:30-16:00
Break
16:00-16:50
Pablo Parrilo (Massachusetts Institute of Technology)
Flow Representations of Games: Near Potential Games and Dynamics

Wednesday, January 12, 2011

Morning Session

08:00-09:00
Continental Breakfast
09:00-09:50
Rahul Jain (University of Southern California (USC))
Strategic Arrivals into Queueing Networks
10:00-10:15
Break
10:15-11:05
Walid Saad (Princeton University)
Game Theory for Cooperative Communication Networks
11:15-11:30
Break
11:30-12:20
Aditya Ramamoorthy (Iowa State University)
Selfish distributed compression over networks: Correlation induces Anarchy --

Afternoon Session

12:30-14:30
Lunch (on your own)
14:30-15:20
Éva Tardos (Cornell University)
Price of Anarchy in Adword Auctions
15:30-16:00
Break
16:00-16:50
Adam Meyerson (University of California, Los Angeles (UCLA))
Comparing Nash and Correlated Equilibrium Solutions

Thursday, January 13, 2011

Morning Session

08:00-09:00
Continental Breakfast
09:00-09: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)

Afternoon Session

12:30-14:30
Lunch (on your own)
14:30-15:20
Lance Fortnow (Northwestern University)
Repeated Matching Pennies with Sublinear Randomness
15:30-15:45
Break
15:45-17:00
Panel Discussion

Friday, January 14, 2011

Morning Session

08:00-09:00
Continental Breakfast
09:00-09: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

Afternoon Session

12:30-13:30
Lunch (on your own)
13:45-14:35
Kamal Jain (Microsoft Research)
Matching in lopsided bipartite graphs and a new matching polytope.
15:00-16:00
Shing-Tung Yau (Harvard University)
The Shape of Inner Space
16:00
Reception (Location: IPAM Lobby)
Printable Version