Sciweavers

800 search results - page 110 / 160
» On the Complexity of Parity Games
Sort
View
SIGECOM
2006
ACM
142views ECommerce» more  SIGECOM 2006»
14 years 3 months ago
Computing the optimal strategy to commit to
In multiagent systems, strategic settings are often analyzed under the assumption that the players choose their strategies simultaneously. However, this model is not always realis...
Vincent Conitzer, Tuomas Sandholm
FC
2006
Springer
145views Cryptology» more  FC 2006»
14 years 22 days ago
Efficient Correlated Action Selection
Abstract. Participants in e-commerce and other forms of online collaborations tend to be selfish and rational, and therefore game theory has been recognized as particularly relevan...
Mikhail J. Atallah, Marina Blanton, Keith B. Frikk...
ATAL
2010
Springer
13 years 10 months ago
Frequency adjusted multi-agent Q-learning
Multi-agent learning is a crucial method to control or find solutions for systems, in which more than one entity needs to be adaptive. In today's interconnected world, such s...
Michael Kaisers, Karl Tuyls
SI3D
2006
ACM
14 years 3 months ago
Normal mapping for precomputed radiance transfer
Normal mapping is a variant of bump mapping that is commonly used in computer games. It models complex surface variations by explicitly storing a surface normal in a texture map. ...
Peter-Pike J. Sloan
IAT
2005
IEEE
14 years 2 months ago
An Approximate Pareto Optimal Cooperative Negotiation Model for Multiple
Cooperative negotiation is proved to be an effective paradigm to solve complex dynamic multi-objective problems in which each objective is associated to an agent. When the multi-o...
Nicola Gatti, Francesco Amigoni