Titlebook: Algorithmic Game Theory; Third International Spyros Kontogiannis,Elias Koutsoupias,Paul G. Spir Conference proceedings 2010 Springer-Verla

autoantibodies

書目名稱Algorithmic Game Theory影響因子(影響力)




書目名稱Algorithmic Game Theory影響因子(影響力)學(xué)科排名




書目名稱Algorithmic Game Theory網(wǎng)絡(luò)公開度




書目名稱Algorithmic Game Theory網(wǎng)絡(luò)公開度學(xué)科排名




書目名稱Algorithmic Game Theory被引頻次




書目名稱Algorithmic Game Theory被引頻次學(xué)科排名




書目名稱Algorithmic Game Theory年度引用




書目名稱Algorithmic Game Theory年度引用學(xué)科排名




書目名稱Algorithmic Game Theory讀者反饋




書目名稱Algorithmic Game Theory讀者反饋學(xué)科排名

檢查

https://doi.org/10.1007/978-3-662-39685-8e existence of pure Nash equilibria in subgames. Specifically, we show that the existence of a . pure Nash equilibrium in every . implies the weak acyclicity of a game. In contrast, the possible existence of . pure Nash equilibria in every subgame is . for weak acyclicity.

有危險(xiǎn)

A Simplex-Like Algorithm for Fisher Markets,this polytope. The convex cost function depends only on the initial endowments of the buyers. This formulation yields an easy simplex-like pivoting algorithm which is provably strongly polynomial for many special cases.

拉開這車床

Tortuous

crumble

outset

Computing Stable Outcomes in Hedonic Games,ble outcome and all these problems are in PLS. The different stability requirements correspond to different local search neighbourhoods. For different neighbourhood structures, our findings comprise positive results in the form of polynomial-time algorithms for finding stable outcomes, and negative (PLS-completeness) results.

提煉

The Computational Complexity of Trembling Hand Perfection and Other Equilibrium Refinements,was previously shown to be .-hard by Borgs ., while a . hardness result is given in this paper. The latter proof yields bounds on the algebraic degree of the minmax value of a three-player game that may be of independent interest.

跳動(dòng)

Pareto Efficiency and Approximate Pareto Efficiency in Routing and Load Balancing Games,erent solutions. The settings we consider include load balancing games on identical, uniformly-related, and unrelated machines, both using pure and mixed strategies, and nonatomic routing in general and some specific networks.

Organization

A Direct Reduction from ,-Player to 2-Player Approximate Nash Equilibrium,r games is in PPAD, and reducing a PPAD-complete problem to computing approximate Nash equilibrium for 2-player games. Our direct reduction makes no use of the concept of PPAD, eliminating some of the difficulties involved in following the known indirect reduction.