294 search results - page 31 / 59 » The complexity of computing a Nash equilibrium |
ICALP
2004
Springer
15 years 3 months ago
2004
Springer
Abstract. We introduce the notion of coordination mechanisms to improve the performance in systems with independent selfish and noncolluding agents. The quality of a coordination ...
INFOCOM
2012
IEEE
13 years 6 days ago
2012
IEEE
—Current-generation cloud computing is offered with usage-based pricing, with no bandwidth capacity guarantees, which is however unappealing to bandwidth-intensive applications s...
WINE
2005
Springer
15 years 3 months ago
2005
Springer
This paper studies the equilibrium property and algorithmic complexity of the exchange market equilibrium problem with concave piece-wise linear functions, which include linear an...
MOBIHOC
2007
ACM
15 years 9 months ago
2007
ACM
We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distribute...
GLOBECOM
2009
IEEE
15 years 4 months ago
2009
IEEE
— In this paper, we propose a game theoretic approach to tackle the problem of the distributed formation of the hierarchical network architecture that connects the nodes in the u...