Titlebook: Web and Internet Economics; 9th International Co Yiling Chen,Nicole Immorlica Conference proceedings 2013 Springer-Verlag Berlin Heidelberg

chapel

Individual

Revenue Maximization with Nonexcludable Goods,igating nonexcludability by collecting tolls for using the facilities. We show that such “posted-price” mechanisms obtain significantly higher revenue, and often approach the optimal revenue obtainable with full excludability.

疏远天际

Suppository

Trading Agent Kills Market Information,ng agent shifts the dynamics of information revelation from a high-effort norm to a low-effort information equilibrium. We test our hypothesis with a natural experiment on Smava.de and find strong support for our proposition.

傻

Trading Agent Kills Market Information,ng agent shifts the dynamics of information revelation from a high-effort norm to a low-effort information equilibrium. We test our hypothesis with a natural experiment on Smava.de and find strong support for our proposition.

动作谜

,Resolving Braess’s Paradox in Random Networks,most (1 + .). . + ., where . . is the equilibrium latency of the best subnetwork. Our approximation scheme runs in polynomial time if the random network has average degree .(poly(ln .)) and the traffic rate is .(poly(ln ln .)), and in quasipolynomial time for average degrees up to .(.) and traffic rates of .(poly(ln .)).

GLOSS

PACK

The Asymmetric Matrix Partition Problem,employ an identical partition for all rows, and prove that it is essentially trivial. Our matrix partition problem draws its interest from several applications like broad matching in sponsored search advertising and information revelation in market settings. We conclude by discussing the latter appl

易怒

wall-stress

Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3,igraph variant of the well-known Caccetta-Häggkvist conjecture [4]. A probabilistic argument [13] shows that there exist .-well-supported equilibria with supports of cardinality ., for any . > 0; thus, the polylogarithmic cardinality bound presented cannot be greatly improved. We also show that for