Sciweavers

337 search results - page 40 / 68
» Game Theory Using Genetic Algorithms
Sort
View
AI
2006
Springer
13 years 8 months ago
Backward-chaining evolutionary algorithms
Starting from some simple observations on a popular selection method in Evolutionary Algorithms (EAs)--tournament selection--we highlight a previously-unknown source of inefficien...
Riccardo Poli, William B. Langdon
SIGECOM
2006
ACM
143views ECommerce» more  SIGECOM 2006»
14 years 2 months ago
The computational complexity of nash equilibria in concisely represented games
Games may be represented in many different ways, and different representations of games affect the complexity of problems associated with games, such as finding a Nash equilib...
Grant Schoenebeck, Salil P. Vadhan
SAGT
2010
Springer
160views Game Theory» more  SAGT 2010»
13 years 6 months ago
How Do You Like Your Equilibrium Selection Problems? Hard, or Very Hard?
The PPAD-completeness of Nash equilibrium computation is taken as evidence that the problem is computationally hard in the worst case. This evidence is necessarily rather weak, in ...
Paul W. Goldberg
BIOWIRE
2007
Springer
14 years 2 months ago
Coalition Games and Resource Allocation in Ad-Hoc Networks
In this paper we explore some of the connections between cooperative game theory and the utility maximization framework for routing and flow control in networks. Central to both a...
Richard J. Gibbens, Peter B. Key
GAMESEC
2010
128views Game Theory» more  GAMESEC 2010»
13 years 6 months ago
Tracking Games in Mobile Networks
Abstract. Users of mobile networks can change their identifiers in regions called mix zones in order to defeat the attempt of third parties to track their location. Mix zones must ...
Mathias Humbert, Mohammad Hossein Manshaei, Julien...