Sciweavers

1617 search results - page 25 / 324
» Knowledge Condition Games
Sort
View
ICALP
2007
Springer
15 years 1 months ago
Efficient Algorithms for Constant Well Supported Approximate Equilibria in Bimatrix Games
Abstract. In this work we study the tractability of well supported approximate Nash Equilibria (SuppNE in short) in bimatrix games. In view of the apparent intractability of constr...
Spyros C. Kontogiannis, Paul G. Spirakis
JCAL
2010
152views more  JCAL 2010»
14 years 4 months ago
Micro-adaptivity: protecting immersion in didactically adaptive digital educational games
The idea of utilizing the rich potential of today's computer games for educational purposes excites educators, scientists and technicians. Despite the significant hype over di...
Michael D. Kickmeier-Rust, Dietrich Albert
ATAL
2009
Springer
15 years 4 months ago
Hedonic coalition nets
In hedonic games, players have the opportunity to form coalitions, and have preferences over the coalitions they might join. Such games can be used to model a variety of settings ...
Edith Elkind, Michael Wooldridge
AI
2008
Springer
14 years 9 months ago
Alternating-offers bargaining with one-sided uncertain deadlines: an efficient algorithm
In the arena of automated negotiations we focus on the principal negotiation protocol in bilateral settings, i.e. the alternatingoffers protocol. In the scientific community it is...
Nicola Gatti, Francesco Di Giunta, Stefano Marino
IWEC
2007
14 years 11 months ago
Game Design Guided by Visual Attention
Abstract. Visual attention plays a critical role in game playing. A better understanding of the allocation of visual attention can benefit the design of game scenarios. In this pa...
Li Jie, James J. Clark