Sciweavers

174 search results - page 21 / 35
» Computer Science and Game Theory: A Brief Survey
Sort
View
MFCS
2005
Springer
14 years 27 days ago
Interactive Algorithms 2005
A sequential algorithm just follows its instructions and thus cannot make a nondeterministic choice all by itself, but it can be instructed to solicit outside help to make a choic...
Yuri Gurevich
MCMASTER
1993
13 years 11 months ago
A Taste of Rewrite Systems
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...
Nachum Dershowitz
ATAL
2010
Springer
13 years 8 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
FOCS
2007
IEEE
14 years 1 months ago
On the Complexity of Nash Equilibria and Other Fixed Points (Extended Abstract)
d Abstract) Kousha Etessami LFCS, School of Informatics University of Edinburgh Mihalis Yannakakis Department of Computer Science Columbia University We reexamine what it means to...
Kousha Etessami, Mihalis Yannakakis
SIGECOM
2005
ACM
153views ECommerce» more  SIGECOM 2005»
14 years 29 days ago
Marginal contribution nets: a compact representation scheme for coalitional games
We present a new approach to representing coalitional games based on rules that describe the marginal contributions of the agents. This representation scheme captures characterist...
Samuel Ieong, Yoav Shoham