Image from Google Jackets

Web and Internet Economics [electronic resource] : 9th International Conference, WINE 2013, Cambridge, MA, USA, December 11-14, 2013, Proceedings / edited by Yiling Chen, Nicole Immorlica.

Contributor(s): Material type: TextTextLanguage: English Series: Lecture Notes in Computer Science ; 8289Publication details: Berlin, Heidelberg : Springer Berlin Heidelberg, 2013.Description: 1 online resource (XIV, 440 p. 25 ill.)ISBN:
  • 9783642450464
Subject(s): Online resources:
Contents:
The Asymmetric Matrix Partition Problem -- Polylogarithmic Supports are required for Approximate Well-Supported Nash Equilibria -- The Computational Complexity of Random Serial Dictatorship -- Incentives and Efficiency in Uncertain Collaborative Environments -- Revenue Maximization with Nonexcludable Goods -- On Lookahead Equilibria in Congestion Games -- Trading Agent Kills Market Information: Evidence from Online Social Lending -- Designing Markets for Daily Deals -- The Exact Computational Complexity of Evolutionarily Stable Strategies -- The Price of Anarchy of the Proportional Allocation Mechanism Revisited -- Valuation Compressions in VCG-Based Combinatorial Auctions -- Limits of Efficiency in Sequential Auctions -- Competition in the Presence of Social Networks: How Many Service Providers Maximize Welfare? -- Resolving Braess's Paradox in Random Networks -- A protocol for cutting matroids like cakes -- Quantitative Comparative Statics for a Multimarket Paradox -- Price of Anarchy for the N-player Competitive Cascade Game with Submodular Activation Functions.
Tags from this library: No tags from this library for this title. Log in to add tags.
Star ratings
    Average rating: 0.0 (0 votes)
Holdings
Item type Current library Call number Materials specified Status Date due Barcode Item holds
Books Books National Library of India Available EBK000025234ENG
Total holds: 0

The Asymmetric Matrix Partition Problem -- Polylogarithmic Supports are required for Approximate Well-Supported Nash Equilibria -- The Computational Complexity of Random Serial Dictatorship -- Incentives and Efficiency in Uncertain Collaborative Environments -- Revenue Maximization with Nonexcludable Goods -- On Lookahead Equilibria in Congestion Games -- Trading Agent Kills Market Information: Evidence from Online Social Lending -- Designing Markets for Daily Deals -- The Exact Computational Complexity of Evolutionarily Stable Strategies -- The Price of Anarchy of the Proportional Allocation Mechanism Revisited -- Valuation Compressions in VCG-Based Combinatorial Auctions -- Limits of Efficiency in Sequential Auctions -- Competition in the Presence of Social Networks: How Many Service Providers Maximize Welfare? -- Resolving Braess's Paradox in Random Networks -- A protocol for cutting matroids like cakes -- Quantitative Comparative Statics for a Multimarket Paradox -- Price of Anarchy for the N-player Competitive Cascade Game with Submodular Activation Functions.

There are no comments on this title.

to post a comment.
                                                                           
web counter

Copyright ©2020 The National Library of India, Govt. of India ↔ Hosted by NVLI, MOC ↔ Technology and Design by National Library of India, Ministry of Culture, Govt. of India