Sciweavers

Share
INFOCOM
1997
IEEE
9 years 8 months ago
Atomic Resource Sharing in Noncooperative Networks
In noncooperative networks, resources are shared among selfish users, which optimize their individual performance measure. We consider the generic and practically important case o...
Lavy Libman, Ariel Orda
WINE
2009
Springer
138views Economy» more  WINE 2009»
9 years 8 months ago
On Strong Equilibria in the Max Cut Game
This paper deals with two games defined upon well known generalizations of max cut. We study the existence of a strong equilibrium which is a refinement of the Nash equilibrium. ...
Laurent Gourvès, Jérôme Monnot
CDC
2009
IEEE
177views Control Systems» more  CDC 2009»
9 years 8 months ago
A control theoretic approach to noncooperative game design
— This paper investigates design of noncooperative games from a control theoretic perspective. Pricing mechanisms are used as a design tool to ensure that the Nash equilibrium of...
Tansu Alpcan, Lacra Pavel, Nem Stefanovic
CDC
2009
IEEE
133views Control Systems» more  CDC 2009»
9 years 8 months ago
New insights on generalized Nash games with shared constraints: Constrained and variational equilibria
— We consider generalized noncooperative Nash games with “shared constraints” in which there is a common constraint that players’ strategies are required to satisfy. We add...
Ankur A. Kulkarni, Uday V. Shanbhag
SIGMETRICS
2010
ACM
208views Hardware» more  SIGMETRICS 2010»
9 years 8 months ago
Dynamics in congestion games
Game theoretic modeling and equilibrium analysis of congestion games have provided insights in the performance of Internet congestion control, road transportation networks, etc. D...
Devavrat Shah, Jinwoo Shin
GECCO
2003
Springer
283views Optimization» more  GECCO 2003»
9 years 9 months ago
A Game-Theoretic Memory Mechanism for Coevolution
One problem associated with coevolutionary algorithms is that of forgetting, where one or more previously acquired traits are lost only to be needed later. We introduce a new coevo...
Sevan G. Ficici, Jordan B. Pollack
ECML
2003
Springer
9 years 9 months ago
Self-evaluated Learning Agent in Multiple State Games
Abstract. Most of multi-agent reinforcement learning algorithms aim to converge to a Nash equilibrium, but a Nash equilibrium does not necessarily mean a desirable result. On the o...
Koichi Moriyama, Masayuki Numao
ATAL
2003
Springer
9 years 9 months ago
Towards a pareto-optimal solution in general-sum games
Multiagent learning literature has investigated iterated twoplayer games to develop mechanisms that allow agents to learn to converge on Nash Equilibrium strategy profiles. Such ...
Sandip Sen, Stéphane Airiau, Rajatish Mukhe...
AMEC
2003
Springer
9 years 9 months ago
Choosing Samples to Compute Heuristic-Strategy Nash Equilibrium
Auctions define games of incomplete information for which it is often too hard to compute the exact Bayesian-Nash equilibrium. Instead, the infinite strategy space is often popu...
William E. Walsh, David C. Parkes, Rajarshi Das
INFOCOM
2003
IEEE
9 years 9 months ago
Oblivious AQM and Nash Equilibria
—An oblivious Active Queue Management scheme is one which does not differentiate between packets belonging to different flows. In this paper, we study the existence and the qual...
Debojyoti Dutta, Ashish Goel, John S. Heidemann
books