Sciweavers

70 search results - page 7 / 14
» Approximate Nash Equilibria under Stability Conditions
Sort
View
ICS
2010
Tsinghua U.
14 years 4 months ago
A New Look at Selfish Routing
: We revisit price of anarchy in network routing, in a new model in which routing decisions are made by self-interested components of the network, as opposed to by the flows as in ...
Christos Papadimitriou, Gregory Valiant
BIOCOMP
2010
13 years 5 months ago
Robust Stability Analysis and Design Under Consideration of Multiple Feedback Loops in the Tryptophan Regulatory Network of E. c
The tryptophan operon of E. coli represents an important regulatory unit consisting of multiple feedback loops. The role of these loops is crucial to understand the dynamics of tr...
Anke Meyer-Bäse, Fabian J. Theis
DSS
2000
113views more  DSS 2000»
13 years 7 months ago
Quality of service provision in noncooperative networks with diverse user requirements
This paper studies the quality of service (QoS) provision problem in noncooperative networks where applications or users are sel sh and routers implement generalized processor sha...
K. Park, M. Sitharam, S. Chen
AAAI
2012
11 years 9 months ago
Generalized Sampling and Variance in Counterfactual Regret Minimization
In large extensive form games with imperfect information, Counterfactual Regret Minimization (CFR) is a popular, iterative algorithm for computing approximate Nash equilibria. Whi...
Richard G. Gibson, Marc Lanctot, Neil Burch, Duane...
SIAMCO
2010
116views more  SIAMCO 2010»
13 years 5 months ago
Large-Population LQG Games Involving a Major Player: The Nash Certainty Equivalence Principle
We consider linear-quadratic-Gaussian (LQG) games with a major player and a large number of minor players. The major player has a significant influence on others. The minor playe...
Minyi Huang