108 search results - page 18 / 22 » -Hardness of Pure Nash Equilibrium in Scheduling and Connect... |
COCOA
2009
Springer
15 years 6 months ago
2009
Springer
Abstract. We study Facility Location games played by n agents situated on the nodes of a graph. Each agent orders installation of a facility at a node of the graph and pays connect...
INFOCOM
2010
IEEE
14 years 10 months ago
2010
IEEE
—We consider the problem of ’fair’ scheduling the resources to one of the many mobile stations by a centrally controlled base station (BS). The BS is the only entity taking d...
JSAC
2007
14 years 11 months ago
2007
— In this paper, a distributive non-cooperative game is proposed to perform sub-channel assignment, adaptive modulation, and power control for multi-cell multi-user Orthogonal Fr...
ICASSP
2009
IEEE
14 years 9 months ago
2009
IEEE
We consider the problem of configuring classifier trees in distributed stream mining system. The configuration involves selecting appropriate false-alarm detection tradeoffs for e...
ATAL
2007
Springer
15 years 5 months ago
2007
Springer
Regret based algorithms have been proposed to control a wide variety of multi-agent systems. The appeal of regretbased algorithms is that (1) these algorithms are easily implement...