Sciweavers

294 search results - page 37 / 59
» The complexity of computing a Nash equilibrium
Sort
View
SIGECOM
2010
ACM
128views ECommerce» more  SIGECOM 2010»
14 years 10 months ago
Equilibria of plurality voting with abstentions
In the traditional voting manipulation literature, it is assumed that a group of manipulators jointly misrepresent their preferences to get a certain candidate elected, while the ...
Yvo Desmedt, Edith Elkind
TON
2008
139views more  TON 2008»
14 years 9 months ago
Stochastic learning solution for distributed discrete power control game in wireless data networks
Distributed power control is an important issue in wireless networks. Recently, noncooperative game theory has been applied to investigate interesting solutions to this problem. Th...
Yiping Xing, Rajarathnam Chandramouli
ICALP
2009
Springer
15 years 10 months ago
On a Network Generalization of the Minmax Theorem
We consider graphical games in which edges are zero-sum games between the endpoints/players; the payoff of a player is the sum of the payoffs from each incident edge. We give a si...
Constantinos Daskalakis, Christos H. Papadimitriou
CCGRID
2007
IEEE
15 years 4 months ago
Fair Game-Theoretic Resource Management in Dedicated Grids
We study two problems directly resulting from organizational decentralization of the Grid. Firstly, the problem of fair scheduling in systems in which the grid scheduler has compl...
Krzysztof Rzadca, Denis Trystram, Adam Wierzbicki
IPPS
2002
IEEE
15 years 2 months ago
A Game-Theoretic Model and Algorithm for Load Balancing in Distributed Systems
In this paper we present a game theoretic framework for obtaining a user-optimal load balancing scheme in heterogeneous distributed systems. We formulate the static load balancing...
Daniel Grosu, Anthony T. Chronopoulos