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

osculate

Ceramic

先兆

商议

,Resolving Braess’s Paradox in Random Networks,of the best subnetwork problem for the class of random . instances proven prone to Braess’s paradox by (Roughgarden and Valiant, RSA 2010) and (Chung and Young, WINE 2010). Our main contribution is a polynomial-time approximation-preserving reduction of the best subnetwork problem for such instances

诙谐

Truthfulness Flooded Domains and the Power of Verification for Mechanism Design,sider any possible (finite or infinite) domain and general symmetric verification. We identify a natural property, namely that the correspondence graph of a symmetric verification . is strongly connected by finite paths along which the preferences are consistent with the preferences at the endpoints

首创精神

Truthfulness Flooded Domains and the Power of Verification for Mechanism Design,sider any possible (finite or infinite) domain and general symmetric verification. We identify a natural property, namely that the correspondence graph of a symmetric verification . is strongly connected by finite paths along which the preferences are consistent with the preferences at the endpoints

GLIDE

adjacent

meritorious

Paleontology

The Computational Complexity of Random Serial Dictatorship,l in the special domain of random assignment where indifferences are unavoidable. While . . is obviously feasible, we show that . the resulting probabilities is #P-complete and thus intractable, both in the context of voting and assignment.