Atjaunināt sīkdatņu piekrišanu

E-grāmata: Web and Internet Economics: 9th International Conference, WINE 2013, Cambridge, MA, USA, December 1-14, 2013, Proceedings

Edited by , Edited by
  • Formāts - PDF+DRM
  • Cena: 53,52 €*
  • * ši ir gala cena, t.i., netiek piemērotas nekādas papildus atlaides
  • Ielikt grozā
  • Pievienot vēlmju sarakstam
  • Šī e-grāmata paredzēta tikai personīgai lietošanai. E-grāmatas nav iespējams atgriezt un nauda par iegādātajām e-grāmatām netiek atmaksāta.

DRM restrictions

  • Kopēšana (kopēt/ievietot):

    nav atļauts

  • Drukāšana:

    nav atļauts

  • Lietošana:

    Digitālo tiesību pārvaldība (Digital Rights Management (DRM))
    Izdevējs ir piegādājis šo grāmatu šifrētā veidā, kas nozīmē, ka jums ir jāinstalē bezmaksas programmatūra, lai to atbloķētu un lasītu. Lai lasītu šo e-grāmatu, jums ir jāizveido Adobe ID. Vairāk informācijas šeit. E-grāmatu var lasīt un lejupielādēt līdz 6 ierīcēm (vienam lietotājam ar vienu un to pašu Adobe ID).

    Nepieciešamā programmatūra
    Lai lasītu šo e-grāmatu mobilajā ierīcē (tālrunī vai planšetdatorā), jums būs jāinstalē šī bezmaksas lietotne: PocketBook Reader (iOS / Android)

    Lai lejupielādētu un lasītu šo e-grāmatu datorā vai Mac datorā, jums ir nepieciešamid Adobe Digital Editions (šī ir bezmaksas lietotne, kas īpaši izstrādāta e-grāmatām. Tā nav tas pats, kas Adobe Reader, kas, iespējams, jau ir jūsu datorā.)

    Jūs nevarat lasīt šo e-grāmatu, izmantojot Amazon Kindle.

This book constitutes the thoroughly refereed conference proceedings of the 9th International Conference on Web and Internet Economics, WINE 2013, held in Cambridge, MA, USA, in December 2013. The 36 revised full papers were carefully reviewed and selected from 150 submissions and cover research in theoretical computer science, artificial intelligence and microeconomics.

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.

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.