Sciweavers

337 search results - page 23 / 68
» Game Theory Using Genetic Algorithms
Sort
View
SIGECOM
2003
ACM
135views ECommerce» more  SIGECOM 2003»
14 years 1 months ago
Playing large games using simple strategies
We prove the existence of -Nash equilibrium strategies with support logarithmic in the number of pure strategies. We also show that the payoffs to all players in any (exact) Nash...
Richard J. Lipton, Evangelos Markakis, Aranyak Meh...
ALT
2008
Springer
14 years 5 months ago
On-Line Probability, Complexity and Randomness
Abstract. Classical probability theory considers probability distributions that assign probabilities to all events (at least in the finite case). However, there are natural situat...
Alexey V. Chernov, Alexander Shen, Nikolai K. Vere...
ATAL
2010
Springer
13 years 9 months ago
Enumeration and exact design of weighted voting games
In many multiagent settings, situations arise in which agents must collectively make decisions while not every agent is supposed to have an equal amount of influence in the outcom...
Bart de Keijzer, Tomas Klos, Yingqian Zhang
CORR
2007
Springer
84views Education» more  CORR 2007»
13 years 8 months ago
Undirected Graphs of Entanglement Two
Entanglement is a complexity measure of directed graphs that origins in fixed point theory. This measure has shown its use in designing efficient algorithms to verify logical prop...
Walid Belkhir, Luigi Santocanale
IJSR
2011
74views more  IJSR 2011»
13 years 3 months ago
Acting Deceptively: Providing Robots with the Capacity for Deception
Deception is utilized by a variety of intelligent systems ranging from insects to human beings. It has been argued that the use of deception is an indicator of theory of mind [2] ...
Alan R. Wagner, Ronald C. Arkin