Titlebook: Internet and Network Economics; 7th International Wo Ning Chen,Edith Elkind,Elias Koutsoupias Conference proceedings 2011 Springer-Verlag G

Strategy

书目名称Internet and Network Economics影响因子(影响力)




书目名称Internet and Network Economics影响因子(影响力)学科排名




书目名称Internet and Network Economics网络公开度




书目名称Internet and Network Economics网络公开度学科排名




书目名称Internet and Network Economics被引频次




书目名称Internet and Network Economics被引频次学科排名




书目名称Internet and Network Economics年度引用




书目名称Internet and Network Economics年度引用学科排名




书目名称Internet and Network Economics读者反馈




书目名称Internet and Network Economics读者反馈学科排名

Constitution

Conference proceedings 2011ecember 2011. The 31 revised full papers and 5 revised short papers presented together with the abstracts of 3 papers about work in progress were carefully reviewed and selected from 100 submissions. The papers are organized in topical sections on algorithmic game theory, algorithmic mechanism desig

Veneer

0302-9743 vergence and learning in games, economics aspects of security and privacy, information and attention economics, network games and social networks.978-3-642-25509-0978-3-642-25510-6Series ISSN 0302-9743 Series E-ISSN 1611-3349

Adherent

On the Approximation Ratio of ,-Lookahead Auctionokahead is tight. As a byproduct, a theoretical implication of our result is that the gap between the revenues of the optimal deterministically truthful and truthful-in-expectation mechanisms is at most a factor of .. This improves the previous best factor of . in [2].

纠缠

Simple, Optimal and Efficient Auctions are distributed according to independent, not necessarily identical, regular distributions. We also prove a similar guarantee, when the values are drawn i.i.d. from a—possibly irregular—distribution.

挑剔为人

A General Framework for Computing Optimal Correlated Equilibria in Compact Gamesem is tractable; we show that graphical polymatrix games on tree graphs are one example. We also study the problem of computing the optimal ..., a solution concept closely related to CE. Using a similar approach we derive a sufficient condition for this problem, and use it to prove that the problem is tractable for singleton congestion games.

arrhythmic

Approximation Algorithm for Security Games with Costly Resources the study of the following optimization problem: Minimize the total cost of the purchased resources, given that every target has to be defended with at least a certain probability. We give an efficient logarithmic approximation algorithm for this problem.

Shuttle

半球

flamboyant