Internet and Network Economics

6th International Workshop, WINE 2010, Stanford, CA, USA, December 13-17, 2010. Proceedings

Editors:

ISBN: 978-3-642-17571-8 (Print) 978-3-642-17572-5 (Online)

Table of contents (52 chapters)

previous Page of 3
  1. Front Matter

    Pages -

  2. Regular Papers

    1. No Access

      Book Chapter

      Pages 1-13

      Efficient Computation of the Shapley Value for Centrality in Networks

    2. No Access

      Book Chapter

      Pages 14-25

      On Approximate Nash Equilibria in Network Design

    3. No Access

      Book Chapter

      Pages 26-37

      The Efficiency of Fair Division with Connected Pieces

    4. No Access

      Book Chapter

      Pages 38-49

      Collusion in VCG Path Procurement Auctions

    5. No Access

      Book Chapter

      Pages 50-62

      Sequential Item Pricing for Unlimited Supply

    6. No Access

      Book Chapter

      Pages 63-74

      The Cost of Moral Hazard and Limited Liability in the Principal-Agent Problem

    7. No Access

      Book Chapter

      Pages 75-86

      Specializations and Generalizations of the Stackelberg Minimum Spanning Tree Game

    8. No Access

      Book Chapter

      Pages 87-105

      A Novel Approach to Propagating Distrust

    9. No Access

      Book Chapter

      Pages 106-117

      Incentives in Online Auctions via Linear Programming

    10. No Access

      Book Chapter

      Pages 118-132

      Optimal Pricing in the Presence of Local Network Effects

    11. No Access

      Book Chapter

      Pages 133-144

      Local Dynamics in Bargaining Networks via Random-Turn Games

    12. No Access

      Book Chapter

      Pages 145-157

      Selective Call Out and Real Time Bidding

    13. No Access

      Book Chapter

      Pages 158-169

      Approximation Schemes for Sequential Posted Pricing in Multi-unit Auctions

    14. No Access

      Book Chapter

      Pages 170-181

      Truthful Mechanisms for Exhibitions

    15. No Access

      Book Chapter

      Pages 182-193

      A Truthful Constant Approximation for Maximizing the Minimum Load on Related Machines

    16. No Access

      Book Chapter

      Pages 194-208

      Braess’s Paradox in Large Sparse Graphs

    17. No Access

      Book Chapter

      Pages 209-221

      False-Name-Proofness in Social Networks

    18. No Access

      Book Chapter

      Pages 222-233

      Stackelberg Strategies for Network Design Games

    19. No Access

      Book Chapter

      Pages 234-245

      Winner-Imposing Strategyproof Mechanisms for Multiple Facility Location Games

    20. No Access

      Book Chapter

      Pages 246-257

      Constrained Non-monotone Submodular Maximization: Offline and Secretary Algorithms

previous Page of 3