119 search results - page 15 / 24 » The complexity of pure Nash equilibria |
104
click to vote
WINE
2009
Springer
15 years 6 months ago
2009
Springer
Congestion games are a fundamental and widely studied model for selfish allocation problems like routing and load balancing. An intrinsic property of these games is that players ...
110
click to vote
DIALM
2003
ACM
15 years 5 months ago
2003
ACM
We study topology control problems in ad hoc networks, where network nodes get to choose their power levels in order to ensure desired connectivity properties. Unlike most other w...
112
click to vote
ESA
2009
Springer
15 years 6 months ago
2009
Springer
In this paper, we introduce the bounded budget betweenness centrality game, a strategic network formation game in which nodes build connections subject to a budget constraint in or...
105
click to vote
CSE
2009
IEEE
15 years 3 months ago
2009
IEEE
Social networks are the substrate upon which we make and evaluate many of our daily decisions: our costs and benefits depend on whether--or how many of, or which of--our friends ar...
97
Voted
CORR
2008
Springer
14 years 11 months ago
2008
Springer
Abstract. We introduce two min-max problems: the first problem is to minimize the supremum of finitely many rational functions over a compact basic semi-algebraic set whereas the s...