224 search results - page 30 / 45 » On Nash-Equilibria of Approximation-Stable Games |
ATAL
2005
Springer
14 years 1 months ago
2005
Springer
Agents often want to protect private information, while at the same acting upon the information. These two desires are in conflict, and this conflict can be modeled in strategic...
DSS
2000
13 years 7 months ago
2000
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...
ECML
2003
Springer
14 years 22 days ago
2003
Springer
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...
LPNMR
1999
Springer
13 years 11 months ago
1999
Springer
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
ATAL
2008
Springer
13 years 9 months ago
2008
Springer
Future agent applications will increasingly represent human users autonomously or semi-autonomously in strategic interactions with similar entities. Hence, there is a growing need...