Sciweavers

3504 search results - page 49 / 701
» Computational Aspects of Equilibria
Sort
View
CONCUR
2004
Springer
14 years 2 months ago
µABC: A Minimal Aspect Calculus
Glenn Bruns, Radha Jagadeesan, Alan Jeffrey, James...
ATAL
2007
Springer
14 years 2 months ago
A computational characterization of multiagent games with fallacious rewards
Agents engaged in noncooperative interaction may seek to achieve a Nash equilibrium; this requires that agents be aware of others’ rewards. Misinformation about rewards leads to...
Ariel D. Procaccia, Jeffrey S. Rosenschein
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 7 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
HCI
2009
13 years 6 months ago
Towards a Computational Model of Perception and Action in Human Computer Interaction
The evaluation and design of user interfaces may be facilitated by using performance models based on cognitive architectures. A recent trend in HCI is the increased focus on percep...
Pascal Haazebroek, Bernhard Hommel
ECOOPW
1999
Springer
14 years 29 days ago
A Reflective Architecture for the Support of Aspect-Oriented Programming in Smalltalk
This paper presents a reflective architecture and an implemented prototype that supports aspect oriented programming in Smalltalk. The aspects are metaobjects which are weaved dyn...
Jane Pryor, Natalio Bastán