Displaying similar documents to “Coevolutionary genetic algorithms for establishing Nash equilibrium in symmetric Cournot games.”

Test, Teachers, Quorum (Pure Populations)

Radev, Slavian (2013)

Serdica Journal of Computing

Similarity:

The “trial and error” method is fundamental for Master Minddecision algorithms. On the basis of Master Mind games and strategies weconsider some data mining methods for tests using students as teachers.Voting, twins, opposite, simulate and observer methods are investigated.For a pure data base these combinatorial algorithms are faster then manyAI and Master Mind methods. The complexities of these algorithms arecompared with basic combinatorial methods in AI. ACM Computing Classification...

Evolving small-board Go players using coevolutionary temporal difference learning with archives

Krzysztof Krawiec, Wojciech Jaśkowski, Marcin Szubert (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

We apply Coevolutionary Temporal Difference Learning (CTDL) to learn small-board Go strategies represented as weighted piece counters. CTDL is a randomized learning technique which interweaves two search processes that operate in the intra-game and inter-game mode. Intra-game learning is driven by gradient-descent Temporal Difference Learning (TDL), a reinforcement learning method that updates the board evaluation function according to differences observed between its values for consecutively...

Modern approaches to modeling user requirements on resource and task allocation in hierarchical computational grids

Joanna Kołodziej, Fatos Xhafa (2011)

International Journal of Applied Mathematics and Computer Science

Similarity:

Tasks scheduling and resource allocation are among crucial issues in any large scale distributed system, including Computational Grids (CGs). These issues are commonly investigated using traditional computational models and resolution methods that yield near-optimal scheduling strategies. One drawback of such approaches is that they cannot effectively tackle the complex nature of CGs. On the one hand, such systems account for many administrative domains with their own access policies,...

Equilibrium transitions in finite populations of players

J. Miękisz (2006)

Banach Center Publications

Similarity:

We discuss stochastic dynamics of finite populations of individuals playing symmetric games. We review recent results concerning the dependence of the long-run behavior of such systems on the number of players and the noise level. In the case of two-player games with two symmetric Nash equilibria, when the number of players increases, the population undergoes multiple transitions between its equilibria.

Correlated equilibria in competitive staff selection problem

David M. Ramsey, Krzysztof Szajowski (2006)

Banach Center Publications

Similarity:

This paper deals with an extension of the concept of correlated strategies to Markov stopping games. The Nash equilibrium approach to solving nonzero-sum stopping games may give multiple solutions. An arbitrator can suggest to each player the decision to be applied at each stage based on a joint distribution over the players' decisions. This is a form of equilibrium selection. Examples of correlated equilibria in nonzero-sum games related to the staff selection competition in the case...

Spreading mechanisms of cooperation for the evolutionary Prisoner's Dilemma games

György Szabó (2008)

Banach Center Publications

Similarity:

We survey several mechanisms supporting the maintenance of cooperation for evolutionary Prisoner's Dilemma games. In these models players are located on the sites of a lattice or graph and they can follow one of the pure strategies: cooperation (C) or defection (D). Their total income comes from Prisoner's Dilemma games with their neighbors. We discuss the consequences of different evolutionary rules determining the time-dependence of the strategy distribution and compare the results...

Modeling shortest path games with Petri nets: a Lyapunov based theory

Julio Clempner (2006)

International Journal of Applied Mathematics and Computer Science

Similarity:

In this paper we introduce a new modeling paradigm for shortest path games representation with Petri nets. Whereas previous works have restricted attention to tracking the net using Bellman's equation as a utility function, this work uses a Lyapunov-like function. In this sense, we change the traditional cost function by a trajectory-tracking function which is also an optimal cost-to-target function. This makes a significant difference in the conceptualization of the problem domain,...