Sciweavers

3504 search results - page 88 / 701
» Computational Aspects of Equilibria
Sort
View
ICDCS
2010
IEEE
14 years 1 months ago
Existence Theorems and Approximation Algorithms for Generalized Network Security Games
—Aspnes et al [2] introduced an innovative game for modeling the containment of the spread of viruses and worms (security breaches) in a network. In this model, nodes choose to i...
V. S. Anil Kumar, Rajmohan Rajaraman, Zhifeng Sun,...
APPROX
2010
Springer
207views Algorithms» more  APPROX 2010»
13 years 11 months ago
Exploiting Concavity in Bimatrix Games: New Polynomially Tractable Subclasses
Abstract. We study the fundamental problem of computing an arbitrary Nash equilibrium in bimatrix games. We start by proposing a novel characterization of the set of Nash equilibri...
Spyros C. Kontogiannis, Paul G. Spirakis
WIOPT
2010
IEEE
13 years 7 months ago
Routing games : From egoism to altruism
The paper studies the routing in the network shared by several users. Each user seeks to optimize either its own performance or some combination between its own performance and tha...
Amar Prakash Azad, Eitan Altman, Rachid El Azouzi
CDC
2010
IEEE
104views Control Systems» more  CDC 2010»
13 years 5 months ago
Single timescale regularized stochastic approximation schemes for monotone Nash games under uncertainty
Abstract-- In this paper, we consider the distributed computation of equilibria arising in monotone stochastic Nash games over continuous strategy sets. Such games arise in setting...
Jayash Koshal, Angelia Nedic, Uday V. Shanbhag
COGSR
2010
166views more  COGSR 2010»
13 years 5 months ago
A computational model based on Gross' emotion regulation theory
Emotion regulation describes how a subject can use certain strategies to affect emotion response levels. Usually, models for emotion regulation assume mechanisms based on feedback...
Tibor Bosse, Matthijs Pontier, Jan Treur