Sciweavers

374 search results - page 20 / 75
» Generalized Nash equilibrium problems
Sort
View
PE
2002
Springer
109views Optimization» more  PE 2002»
13 years 7 months ago
Non-cooperative routing in loss networks
The paper studies routing in loss networks in the framework of a non-cooperative game with selfish users. Two solution concepts are considered: the Nash equilibrium, corresponding...
Eitan Altman, Rachid El Azouzi, Vyacheslav M. Abra...
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...
ICCV
2009
IEEE
13 years 5 months ago
Matching as a non-cooperative game
With this paper we offer a game-theoretic perspective for the all-pervasive matching problem in computer vision. Specifically, we formulate the matching problem as a (population) ...
Andrea Albarelli, Samuel Rota Bulò, Andrea ...
ICALP
2011
Springer
12 years 11 months ago
Restoring Pure Equilibria to Weighted Congestion Games
Abstract. Congestion games model several interesting applications, including routing and network formation games, and also possess attractive theoretical properties, including the ...
Konstantinos Kollias, Tim Roughgarden
TCS
2010
13 years 2 months ago
Window-games between TCP flows
We consider network congestion problems between TCP flows and define a new game, the Window-game, which models the problems of network congestion caused by the competing flows. An...
Pavlos S. Efraimidis, Lazaros Tsavlidis, George B....