Computational Microeconomics Reading Group (Fall '10)

 

Time/Place: Wednesdays, 2:30pm - 4:00pm at D344 LSRC.

Organizers: Vincent Conitzer, Kamesh Munagala.

Coordinator: If you wish to be included in the mailing list or present a paper, please email Sayan Bhattacharya.

Theme: Computational economics, Approximation algorithms, Applications to databases and networking.
               We will alternate between computational economics and approximation/online algorithms every week.

Past Meetings: Spring '10

 

Schedule:

Date Topic Speaker Paper
09/08/10 ECON Sayan Bhattacharya Revenue maximization with a single sample
09/15/10 APPROX Janardhan Kulkarni Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs
09/22/10 ECON Salman Parsa Profit maximization in mechanism design
09/29/10 APPROX Janardhan Kulkarni Randomized Approximation Schemes for Cuts and Flows in Capacitated Graphs(contd.)
10/06/10 ECON Sayan Bhattacharya Mechanism Design via Correlation Gap
10/13/10 APPROX Xiaoming Xu An improved LP-based approximation for steiner tree
10/20/10 ECON Dima Korzhyk Solving Stackelberg Games with Uncertain Observability
11/3/10 ECON Sayan Bhattacharya Dynamics of Profit-Sharing Games
11/10/10 APPROX Janardhan Kulkarni Dependent rounding and its applications to approximation algorithms
11/17/10 ECON Sayan Bhattacharya Better vaccination strategies for better people
11/24/10 APPROX    
12/1/10 ECON    

 

Related Papers: