Sciweavers

337 search results - page 32 / 68
» Game Theory Using Genetic Algorithms
Sort
View
GECCO
2007
Springer
183views Optimization» more  GECCO 2007»
14 years 2 months ago
Distribution replacement: how survival of the worst can out perform survival of the fittest
A new family of "Distribution Replacement” operators for use in steady state genetic algorithms is presented. Distribution replacement enforces the members of the populatio...
Howard Tripp, Phil Palmer
GECCO
2004
Springer
134views Optimization» more  GECCO 2004»
14 years 1 months ago
A New Universal Cellular Automaton Discovered by Evolutionary Algorithms
In Twenty Problems in the Theory of Cellular Automata, Stephen Wolfram asks “how common computational universality and undecidability [are] in cellular automata.” This papers p...
Emmanuel Sapin, Olivier Bailleux, Jean-Jacques Cha...
NIPS
2004
13 years 10 months ago
New Criteria and a New Algorithm for Learning in Multi-Agent Systems
We propose a new set of criteria for learning algorithms in multi-agent systems, one that is more stringent and (we argue) better justified than previous proposed criteria. Our cr...
Rob Powers, Yoav Shoham
SIGECOM
2008
ACM
103views ECommerce» more  SIGECOM 2008»
13 years 8 months ago
Mechanism design over discrete domains
Often, we wish to design incentive-compatible algorithms for settings in which the players' private information is drawn from discrete domains (e.g., integer values). Our mai...
Ahuva Mu'alem, Michael Schapira
CCS
2008
ACM
13 years 10 months ago
Revocation games in ephemeral networks
A frequently proposed solution to node misbehavior in mobile ad hoc networks is to use reputation systems. But in ephemeral networks - a new breed of mobile networks where contact...
Maxim Raya, Mohammad Hossein Manshaei, Márk...