Internet and Network Economics

Invited Talks.- Ad Exchanges: Research Issues.- Adaptive Learning in Systems of Interacting Agents.- Quantifying Outcomes in Games.- Regular Papers.- Competitive Routing over Time.- On 2-Player Randomized Mechanisms for Scheduling.- On Stackelberg Pricing with Computationally Bounded Consumers.- On Best Response Dynamics in Weighted Congestion Games with Polynomial Delays.- Parametric Packing of Selfish Items and the Subset Sum Algorithm.- An Online Multi-unit Auction with Improved Competitive Ratio.- Prediction Mechanisms That Do Not Incentivize Undesirable Actions.- Pricing Strategies for Viral Marketing on Social Networks.- Consistent Continuous Trust-Based Recommendation Systems.- The Stackelberg Minimum Spanning Tree Game on Planar and Bounded-Treewidth Graphs.- Tighter Bounds for Facility Games.- Degrees of Guaranteed Envy-Freeness in Finite Bounded Cake-Cutting Protocols.- Approximate Pure Nash Equilibria via Lovász Local Lemma.- Externalities in Keyword Auctions: An Empirical and Theoretical Assessment.- Covering Games: Approximation through Non-cooperation.- Contract Auctions for Sponsored Search.- Bidding for Representative Allocations for Display Advertising.- Social Networks and Stable Matchings in the Job Market.- Maximizing the Minimum Load: The Cost of Selfishness.- Competitive Repeated Allocation without Payments.- Pseudonyms in Cost-Sharing Games.- Computing Optimal Contracts in Series-Parallel Heterogeneous Combinatorial Agencies.- Nash Equilibria for Voronoi Games on Transitive Graphs.- Selfish Scheduling with Setup Times.- Computational Aspects of Multimarket Price Wars.- The Impact of Social Ignorance on Weighted Congestion Games.- The Complexity of Models of International Trade.- The Geometry of Truthfulness.- Optimal Incentives for Participationwith Type-Dependent Externalities.- Nash Dynamics in Congestion Games with Similar Resources.- Online Ad Assignment with Free Disposal.- Truthful and Quality Conscious Query Incentive Networks.- An