Sciweavers

3780 search results - page 250 / 756
» Algorithms for Game Metrics
Sort
View
ATAL
2010
Springer
15 years 8 months ago
Path disruption games
We propose Path Disruption Games (PDGs), which consider collaboration between agents attempting stop an adversary from travelling from a source node to a target node in a graph. P...
Yoram Bachrach, Ely Porat
CORR
2011
Springer
178views Education» more  CORR 2011»
15 years 2 months ago
Robust Additively Coupled Games
We determine the robust Nash equilibrium (RNE) for a wide range of problems in communications systems and networks that are faced with uncertainty in their parameters’ values. T...
Saeedeh Parsaeefard, Ahmad R. Sharafat, Mihaela va...
TSP
2010
15 years 1 months ago
Cooperative resource allocation games under spectral mask and total power constraints
Resource allocation problems in multi-user systems, modeled as Nash bargaining (NB) cooperative games, are investigated under different constraints. Using the joint time division m...
Jie Gao, Sergiy A. Vorobyov, Hai Jiang
AAIM
2009
Springer
143views Algorithms» more  AAIM 2009»
15 years 5 months ago
Discrete online TSP
In this paper we introduce a discrete version of the online traveling salesman problem (DOLTSP). We represent the metric space using a weighted graph, where the server is allowed t...
Mauro Aprea, Esteban Feuerstein, Gustavo Sadovoy, ...
ICASSP
2009
IEEE
16 years 1 months ago
Game theory for precoding in a multi-user system: Bargaining for overall benefits
A precoding strategy for multi-user spectrum sharing over an interference channel is proposed and analyzed from a game-theoretic perspective. The proposed strategy is based on fi...
Jie Gao, Sergiy A. Vorobyov, Hai Jiang