Titlebook: Algorithmic Game Theory; 5th International Sy Maria Serna Conference proceedings 2012 Springer-Verlag Berlin Heidelberg 2012 adwords.econom

议程

Approximating the Minmax Value of Three-Player Games within a Constant is as Hard as Detecting Planfs, approximating the minmax value within an additive constant smaller than ./2, where ., is not possible by a polynomial time algorithm. This is based on assuming hardness of a version of the so-called planted clique problem in Erdős-Rényi random graphs, namely that of . a planted clique. Our resul

HEDGE

冰河期

Ornament

Capacitated Network Design Games,h edge is shared equally among its agents. The uncapacitated version of this problem has been introduced by Anshelevich . (2003) and has been extensively studied. We find that the consideration of edge capacities entails a significant effect on the quality of the obtained Nash equilibria (NE), under

HAWK

Canyon

On the Hardness of Network Design for Bottleneck Routing Games, fact, a.k.a. Braess’s paradox, gives rise to the network design problem, where we seek to recognize routing games suffering from the paradox, and to improve the equilibrium performance by edge removal. In this work, we investigate the computational complexity and the approximability of network desi

防止

辩论

Commodity Auctions and Frugality Ratios,wn number of items, and a private cost for supplying those items. Thus a “feasible set” of sellers (a set that is able to comprise the winning bidders) is any set of sellers whose total quantity sums to at least .. We show that, even in a limited special case, VCG has a . of at least . − 1 (with res

一瞥

GULP