Sciweavers

1884 search results - page 31 / 377
» Simple Algorithm for Simple Timed Games
Sort
View
IPPS
2007
IEEE
15 years 4 months ago
Evolution of Strategy Driven Behavior in Ad Hoc Networks Using a Genetic Algorithm
In this paper we address the problem of selfish behavior in ad hoc networks. We propose a strategy driven approach which aims at enforcing cooperation between network participant...
Marcin Seredynski, Pascal Bouvry, Mieczyslaw A. Kl...
EVOW
2010
Springer
15 years 4 months ago
Evolving Behaviour Trees for the Commercial Game DEFCON
Abstract. Behaviour trees provide the possibility of improving on existing Artificial Intelligence techniques in games by being simple to implement, scalable, able to handle the c...
Chong-U Lim, Robin Baumgarten, Simon Colton
CORR
2010
Springer
110views Education» more  CORR 2010»
14 years 10 months ago
Mixing Time and Stationary Expected Social Welfare of Logit Dynamics
We study logit dynamics [3] for strategic games. At every stage of the game a player is selected uniformly at random and she is assumed to play according to a noisy best-response ...
Vincenzo Auletta, Diodato Ferraioli, Francesco Pas...
ECAL
2003
Springer
15 years 3 months ago
Language Games with Mixed Populations
This paper presents an adaptation of Luc Steels’s model of Category Formation and Language Sharing. The simple competitive learning algorithm is proposed as a more general means ...
Michael Lewin, Emmet Spier
SAGT
2010
Springer
175views Game Theory» more  SAGT 2010»
14 years 8 months ago
On Learning Algorithms for Nash Equilibria
Can learning algorithms find a Nash equilibrium? This is a natural question for several reasons. Learning algorithms resemble the behavior of players in many naturally arising gam...
Constantinos Daskalakis, Rafael Frongillo, Christo...