Internet and Network Economics

1. Front Matter

   PDF

2. Invited Talks

   1. Ad Exchanges: Research Issues

      • S. Muthukrishnan

      Pages 1-12

   2. Adaptive Learning in Systems of Interacting Agents

      • H. Peyton Young

      Pages 13-16

   3. Quantifying Outcomes in Games

      • Éva Tardos

      Pages 17-17

3. Regular Papers

   1. Competitive Routing over Time

      • Martin Hoefer, Vahab S. Mirrokni, Heiko Röglin, Shang-Hua Teng

      Pages 18-29

   2. On 2-Player Randomized Mechanisms for Scheduling

      • Pinyan Lu

      Pages 30-41

   3. On Stackelberg Pricing with Computationally Bounded Consumers

      • Patrick Briest, Martin Hoefer, Luciano Gualà, Carmine Ventre

      Pages 42-54

   4. On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays

      • Angelo Fanelli, Luca Moscardelli

      Pages 55-66

   5. Parametric Packing of Selfish Items and the Subset Sum Algorithm

      • Leah Epstein, Elena Kleiman, Julián Mestre

      Pages 67-78

   6. An Online Multi-unit Auction with Improved Competitive Ratio

      • Sourav Chakraborty, Nikhil Devanur

      Pages 79-88

   7. Prediction Mechanisms That Do Not Incentivize Undesirable Actions

      • Peng Shi, Vincent Conitzer, Mingyu Guo

      Pages 89-100

   8. Pricing Strategies for Viral Marketing on Social Networks

      • David Arthur, Rajeev Motwani, Aneesh Sharma, Ying Xu

      Pages 101-112

   9. Consistent Continuous Trust-Based Recommendation Systems

      • Ola Rozenfeld, Moshe Tennenholtz

      Pages 113-124

   10. The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs

       • Jean Cardinal, Erik D. Demaine, Samuel Fiorini, Gwenaël Joret, Ilan Newman, Oren Weimann

       Pages 125-136

   11. Tighter Bounds for Facility Games

       • Pinyan Lu, Yajun Wang, Yuan Zhou

       Pages 137-148

   12. Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols

       • Claudia Lindner, Jörg Rothe

       Pages 149-159

   13. Approximate Pure Nash Equilibria via Lovász Local Lemma

       • Thành Nguyen, Éva Tardos

       Pages 160-171

   14. Externalities in Keyword Auctions: An Empirical and Theoretical Assessment

       • Renato Gomes, Nicole Immorlica, Evangelos Markakis

       Pages 172-183

   15. Covering Games: Approximation through Non-cooperation

       • Martin Gairing

       Pages 184-195

   16. Contract Auctions for Sponsored Search

       • Sharad Goel, Sébastien Lahaie, Sergei Vassilvitskii

       Pages 196-207

This book constitutes the refereed proceedings of the 5th International Workshop on Internet and Network Economics, WINE 2009, held in Rome, Italy, in December 2009. The 34 regular and 29 short revised full papers presented together with 3 invited talks were carefully reviewed and selected from 142 submissions. The papers address various topics in theoretical computer science, networking and security, economics, mathematics, sociology, and management sciences devoted to the analysis of problems arising in the internet and the worldwide Web, such as auction algorithms, computational advertising, general and majority equilibrium, coalitions, collective action, economics aspects of security and privacy in distributed and network computing, algorithmic design and game theory, information economics, network games, price dynamics, and social networks.

• Internet
• Social Net
• Social Network
• Web
• computer
• privacy
• security

• Department of Information and Systems, Sapienza University of Rome, Roma, Italy

  Stefano Leonardi

Policies and ethics