Best Ph.D. Thesis in Computational Game Theory

A call for applications for Best PhD Thesis Project of the Year in Computational Game Theory is available.  Deadline  for submitting PhD theses summaries:    October 15, 2011.

I like all kinds of prizes and awards in science.  So much cheaper as well as more effective than money.

 

Advertisement

Read Full Post »

INFORMS 2011 cluster on auctions and markets

The upcoming INFORMS 2011 annual meeting (November 13-16, 2011 in Charlotte, North Carolina) will have dozens of talks on “auctions, market design, and optimization in e-markets”.

Read Full Post »

WINE 2011 Accepted Papers

The list of accepted papers for WINE 2011 is now online.  30 full papers accepted out of 100 submissions (+9 working/short papers).

Read Full Post »

SODA 2012 Accepted papers

The list of papers accepted to SODA 2012 is now published.  Here are the AGT/E related ones:

• Popularity vs Maximum cardinality in the stable marriage setting by Telikepalli Kavitha
• Metastability of Logit Dynamics for Coordination Games by Vincenzo Auletta, Diodato Ferraioli, Francesco Pasquale and Giuseppe Persiano
• The Notion of a Rational Convex Program, and an Algorithm for the Arrow-Debreu Nash Bargaining Game by Vijay Vazirani
• A Matroid Approach to Stable Matchings with Lower Quotas by Tamas Fleiner and Naoyuki Kamiyama
• A Universally-truthful Approximation Scheme for Multi-unit Auctions by Berthold Vöcking
• Mechanism Designs via Consensus Estimate and Cross-Check by Bach Ha and Jason Hartline
• Voting with Limited Information and Many Alternatives by Flavio Chierichetti and Jon Kleinberg
• Beyond Myopic Best Response (in Cournot Competition) by Amos Fiat, Elias Koutsoupias, Katrina Ligett, Yishay Mansour and Svetlana Olonetsky
• Sequential Auctions and Externalities by Renato Paes Leme, Vasilis Syrgkanis and Eva Tardos
• Optimal Crowdsourcing Contests by Shuchi Chawla, Jason D. Hartline and Balasubramanian Sivan
• On the hardness of pricing loss leaders by Preyas Popat and Yi Wu
• Simultaneous Approximations for Adversarial and Stochastic Online Budgeted Allocation by Vahab Mirrokni, Shayan Oveis Gharan and Morteza Zadimoghaddam
• Black-Box Reductions for Cost-Sharing Mechanism Design by Konstantinos Georgiou and Chaitanya Swamy
• Sketching Valuation Functions by Ashwinkumar Badanidiyuru, Shahar Dobzinski, Hu Fu, Robert Kleinberg, Noam Nisan and Tim Roughgarden

 

Read Full Post »