Sciweavers

108 search results - page 7 / 22
» -Hardness of Pure Nash Equilibrium in Scheduling and Connect...
Sort
View
WINE
2005
Springer
179views Economy» more  WINE 2005»
14 years 25 days ago
A Graph-Theoretic Network Security Game
Consider a network vulnerable to viral infection. The system security software can guarantee safety only to a limited part of the network. Such limitations result from economy cos...
Marios Mavronicolas, Vicky G. Papadopoulou, Anna P...
WINE
2009
Springer
138views Economy» more  WINE 2009»
14 years 1 months ago
On the Impact of Strategy and Utility Structures on Congestion-Averse Games
Recent results regarding games with congestion-averse utilities (or, congestion-averse games—CAGs) have shown they possess some very desirable properties. Specifically, they hav...
Thomas Voice, Maria Polukarov, Andrew Byde, Nichol...
WAW
2010
Springer
311views Algorithms» more  WAW 2010»
13 years 5 months ago
Game-Theoretic Models of Information Overload in Social Networks
We study the effect of information overload on user engagement in an asymmetric social network like Twitter. We introduce simple game-theoretic models that capture rate competition...
Christian Borgs, Jennifer T. Chayes, Brian Karrer,...
TSP
2008
116views more  TSP 2008»
13 years 7 months ago
Optimal Linear Precoding Strategies for Wideband Noncooperative Systems Based on Game Theory - Part I: Nash Equilibria
In this two-part paper, we propose a decentralized strategy, based on a game-theoretic formulation, to find out the optimal precoding/multiplexing matrices for a multipoint-to-mult...
Gesualdo Scutari, Daniel Pérez Palomar, Ser...
MST
2010
98views more  MST 2010»
13 years 5 months ago
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Abstract. We investigate the effect of linear independence in the strategies of congestion games on the convergence time of best improvement sequences and on the pure Price of Anar...
Dimitris Fotakis