Monday,
December 13, 2010 

9:0010:00: Plenary talk by Nimrod Megiddo: Some Challenges in the Application of Game Theory 

10:3012:30: Sessions 1A and 1B 

Selective Call Out and Real Time Bidding Tanmoy Chakraborty,
Eyal EvenDar, Sudipto Guha, Yishay Mansour, and S. Muthukrishnan Value of Learning in Sponsored Search Auctions SaiMing Li, Mohammad Mahdian, and R. Preston McAfee Approximation Algorithms for Campaign Management Edith Elkind and Piotr
Faliszewski Discrete Strategies in Keyword Auctions and Their Inefficiency for Locally
Aware Bidders Evangelos Markakis and Orestis Telelis An Axiomatic Characterization of ContinuousOutcome Market Makers Xi Alice Gao and Yiling
Chen 
On Approximate Nash Equilibria in Network
Design Susanne Albers and Pascal Lenzner NearStrong Equilibria in Network Creation
Games Ola Rozenfeld and Moshe Tennenholtz Stackelberg Strategies for Network
Design Games Angelo Fanelli, Michele Flammini,
and Luca Moscardelli The Complexity of Equilibria in Cost Sharing
Games Vasilis Syrgkanis 

2:003:00: Plenary talk by Daron Acemoglu: 

3:305:30: Sessions 2A and 2B 

Practical and Efficient Approximations of Nash Equilibria for WinLose Games Based on Graph Spectra Haralampos Tsaknakis and Paul G. Spirakis Market Communication in Production Economies Christopher A. Wilkens Nonseparable, Quasiconcave Utilities Are
Easy – In a Perfect Price Discrimination Market Model Vijay V. Vazirani The Complexity of Determining the Uniqueness of Tarski’s Fixed Point under
the Lexicographic Ordering Chuangyin Dang and Yinyu Ye Market Equilibrium with Transaction Costs Sourav Chakraborty,
Nikhil R. Devanur, and Chinmay
Karande 
The Efficiency of Fair Division with Connected Pieces Yonatan Aumann and Yair
Dombb You Share, I Share: Network Effects and Economic Incentives in P2P
FileSharing Systems Mahyar Salek,
Shahin Shayandeh, and
David Kempe The Good, The Bad and The Cautious: Safety Level Cooperative Games Yoram Bachrach,
Maria Polukarov, and Nicholas R. Jennings Online Labor Markets John J. Horton Course Allocation by Proxy Auction Scott Duke Kominers, Mike Ruberry, and Jonathan Ullman 

Tuesday,
December 14, 2010 

9:0010:00: Plenary talk by Jennifer Chayes: Strategic Network Models: From Building to Bargaining 10:3012:30: Sessions 3A and 3B 

A Novel Approach to Propagating Distrust Christian Borgs, Jennifer Chayes, Adam Tauman Kalai, Azarakhsh Malekian, and Moshe Tennenholtz Optimal Pricing in the Presence of Local Network Effects Ozan Candogan,
Kostas Bimpikis, and Asuman
Ozdaglar An FPTAS for Bargaining Networks with Unequal Bargaining Powers Yashodhan Kanoria Local Dynamics in Bargaining Networks via RandomTurn Games L. Elisa Celis, Nikhil R. Devanur, and Yuval Peres 
Exploiting Myopic Learning Mohamed Mostagir The Cost of Moral Hazard and Limited Liability in the PrincipalAgent
Problem Felipe Balmaceda, Santiago R. Balseiro, Jose R. Correa, and Nicolas E. StierMoses StrategyProof Voting Rules over Multiissue Domains with Restricted
Preferences Lirong Xia and Vincent Conitzer Efficient Computation of the Shapley Value for Centrality in Networks Karthik V. Aadithya,
Balaraman Ravindran,
Tomasz P. Michalak, and Nicholas R. Jennings 








FalseNameProofness in Social Networks Vincent Conitzer, Nicole Immorlica, Joshua Letchford, Kamesh Munagala, and Liad Wagman Impersonation Strategies in Auctions Ian A. Kash and David C. Parkes FalseNameProofness in Facility Location Problem
on the Real Line Taiki Todo,
Atsushi Iwasaki, and Makoto Yokoo Threshold Models for Competitive Influence in Social Networks Allan Borodin, Yuval Filmus, and Joel Oren 
Specializations and Generalizations of the Stackelberg
Minimum Spanning Tree Game Davide Bil`o, Luciano Gual`a, Stefano Leucci, and
Guido Proietti A Truthful Constant Approximation for Maximizing the Minimum Load on
Related Machines George Christodoulou, Annam´aria Kov´acs, and Rob van Stee Improved Hardness of Approximation for Stackelberg
ShortestPath Pricing Patrick Briest, Parinya
Chalermsook, Sanjeev Khanna, Bundit Laekhanukit, and Danupon Nanongkai 



Wednesday,
December 15, 2010 



9:0010:00: Plenary talk by Rakesh Vohra: 10:3012:30: Sessions 5A and 5B 

The Limits of Smoothness: A PrimalDual Framework for Price of Anarchy
Bounds Uri Nadav and Tim Roughgarden Coalition Formation and Price of Anarchy in Cournot
Oligopolies Nicole Immorlica, Evangelos
Markakis, and Georgios Piliouras Braess’s Paradox in Large Sparse Graphs Fan Chung and Stephen J. Young Strategic Cooperation in Cost Sharing Games Martin Hoefer 
Incentives in Online Auctions via Linear
Programming Niv Buchbinder,
Kamal Jain, and Mohit
Singh Approximation Schemes for Sequential Posted Pricing in Multiunit
Auctions Tanmoy Chakraborty,
Eyal EvenDar, Sudipto Guha, Yishay Mansour, and S. Muthukrishnan Collusion in VCG Path Procurement Auctions Yoram Bachrach,
Peter Key, and Morteza Zadimoghaddam Truthful Mechanisms for Exhibitions George Christodoulou, Khaled Elbassioni, and Mahmoud Fouz 

2:003:00: Plenary talk by Michael Kearns: Behavioral Network Formation 3:305:30: Sessions 6A and 6B 

Sequential Item Pricing for Unlimited Supply MariaFlorina Balcan
and Florin Constantin On the Competitive Ratio of Online Sampling Auctions Elias Koutsoupias and George Pierrakos Optimal Iterative Pricing over Social Networks Hessameddin Akhlaghpour, Mohammad Ghodsi, Nima Haghpanah, Vahab S. Mirrokni,
Hamid Mahini, and Afshin Nikzad Equilibrium Pricing with Positive Externalities Nima Anari,
Shayan Ehsani, Mohammad Ghodsi, Nima Haghpanah, Nicole Immorlica, Hamid
Mahini, and Vahab S. Mirrokni EnvyFree Pricing with General Supply Constraints Sungjin Im,
Pinyan Lu, and Yajun Wang 
WinnerImposing Strategyproof
Mechanisms for Multiple Facility Location Games Dimitris Fotakis and Christos Tzamos Constrained Nonmonotone Submodular
Maximization: Offline and Secretary Algorithms Anupam Gupta, Aaron Roth, Grant Schoenebeck, and Kunal Talwar On (Group) StrategyProof Mechanisms without Payment for Facility
Location Games Nguyen Kim Thang AverageCase Analysis of Mechanism Design with Approximate Resource
Allocation Algorithms Yevgeniy Vorobeychik and Yagil Engel Approximation Algorithms for Nonsingleminded ProfitMaximization
Problems with Limited Supply Khaled Elbassioni, Mahmoud
Fouz, and Chaitanya Swamy 







Thursday,
December 16, 2010 


The participants of WINE and WAW are invited by Yahoo! Research to a reception held on Yahoo! campus on Tuesday, December 14th at 6:00 PM. Transportation is provided.
There is an excursion to NightLife at the California Academy of Sciences on Thursday, December 16th (6:009:00 pm). Transportation is provided.
WAW 2010 is held on December 16^{th}.