Titlebook: Algorithmic Game Theory; 8th International Sy Martin Hoefer Conference proceedings 2015 Springer-Verlag Berlin Heidelberg 2015 Social netwo

牵连

难管

0302-9743 ry, SAGT 2015, held in Saarbrücken, Germany, in September 2015...The 22 full papers presented together with one extended abstract and 6 brief announcements were carefully reviewed and selected from 63 submissions. They cover various important aspects of algorithmic game theory, such as matching unde

仪式

motor-unit

COLON

贪心

Cost-Sharing Models in Participatory Sensingdge that can be exploited by innovative applications and data analytics services. A key aspect in all such platforms is that sensor information is not free but comes at a cost. As a result, these platforms may suffer due to insufficient sensor information made publicly available if applications do n

SNEER

Further Results on Capacitated Network Design Gamesplayers using the edge. Every edge has a finite capacity that limits the number of players using the edge. We study the price of stability for such games with respect to the max-cost objective, i.e., the maximum cost paid by any player. We show that the price of stability is .(.) for symmetric games

Conduit

Cost-Sharing Scheduling Games on Restricted Unrelated Machinesthe job strategies. An edge connecting a job and a machine specifies that the job may choose the machine; edge weights correspond to processing times. Each machine has an activation cost that needs to be covered by the job assigned to it. Jobs assigned to a particular machine share its cost proporti

Wordlist

Armory

Towards More Practical Linear Programming-Based Techniques for Algorithmic Mechanism Designed approximation algorithms. Due to the use of the Ellipsoid method, a direct implementation of the method is unlikely to be efficient in practice. We propose to use the much simpler and usually faster multiplicative weights update method instead. The simplification comes at the cost of slightly wea