Sciweavers

649 search results - page 46 / 130
» Focusing in Asynchronous Games
Sort
View
ECCC
2006
71views more  ECCC 2006»
13 years 8 months ago
Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games
We focus on the problem of computing an -Nash equilibrium of a bimatrix game, when is an absolute constant. We present a simple algorithm for computing a 3 4 -Nash equilibrium for ...
Spyros C. Kontogiannis, Panagiota N. Panagopoulou,...
IJUFKS
2010
77views more  IJUFKS 2010»
13 years 6 months ago
How to Handle Interval solutions for Cooperative Interval Games
Interval uncertainty affects our decision making activities on a daily basis making the data structure of intervals of real numbers more and more popular in theoretical models and...
Rodica Branzei, Stef Tijs, S. Z. Alparslan Gö...
GLOBECOM
2009
IEEE
14 years 3 months ago
Price of Anarchy for Cognitive MAC Games
—In this paper, we model and analyze the interactions between secondary users in a spectrum overlay cognitive system as a cognitive MAC game. In this game, each secondary user ca...
Lok Man Law, Jianwei Huang, Mingyan Liu, Shuo-Yen ...
NIPS
2003
13 years 10 months ago
Learning Near-Pareto-Optimal Conventions in Polynomial Time
We study how to learn to play a Pareto-optimal strict Nash equilibrium when there exist multiple equilibria and agents may have different preferences among the equilibria. We focu...
Xiao Feng Wang, Tuomas Sandholm
SCP
2010
172views more  SCP 2010»
13 years 7 months ago
Alternating-time stream logic for multi-agent systems
Constraint automata have been introduced to provide a compositional, operational semantics for the exogenous coordination language Reo, but they can also serve interface specifica...
Sascha Klüppelholz, Christel Baier