Displaying similar documents to “Playing with Flash in ConTeXt-mkiv”

Modern Trends in the Automatic Generation of Content for Video Games

Bontchev, Boyan (2016)

Serdica Journal of Computing

Similarity:

Attractive and realistic content has always played a crucial role in the penetration and popularity of digital games, virtual environments, and other multimedia applications. Procedural content generation enables the automatization of production of any type of game content including not only landscapes and narratives but also game mechanics and generation of whole games. The article offers a comparative analysis of the approaches to automatic generation of content for video games proposed...

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...

The equal split-off set for cooperative games

Rodica Branzei, Dinko Dimitrov, Stef Tijs (2006)

Banach Center Publications

Similarity:

In this paper the equal split-off set is introduced as a new solution concept for cooperative games. This solution is based on egalitarian considerations and it turns out that for superadditive games the equal split-off set is a subset of the equal division core. Moreover, the proposed solution is single valued on the class of convex games and it coincides with the Dutta-Ray constrained egalitarian solution.

Analysis and improvement attempt of prof. Alan Fowler's negotiation game

Jakub Jan Golik (2018)

Annales Universitatis Paedagogicae Cracoviensis | Studia ad Didacticam Mathematicae Pertinentia

Similarity:

The main goal of the following article is to design an improved version of the negotiation game created by prof. Alan Fowler (Fowler, 1997). I have tried to achieve this by constructing four separate versions of the game which represent different approaches while preserving rules, chosen basic technical assumptions and the simplicity of the base game. Each version of the game is supposed to i.a. make it less obvious, create new negotiation possibilities (including potential cooperation),...

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...

Four different approaches to the normalized Banzhaf values of games with a priori unions

Honorata Sosnowska (2006)

Banach Center Publications

Similarity:

Applying the Owen construction of value of games with a priori unions to the normalized Banzhaf value gives a new type of the normalized Banzhaf value for games with a priori unions. Using a simple example of a four-person voting game with a priori unions, it is shown that this value is different from those known in the literature: the normalized Owen-Banzhaf value, the Banzhaf share function defined by van der Laan and van den Brink and the Banzhaf index for simple games with a priori...

Method of construction of the evasion strategy for differential games with many pursuers

Witold Rzymowski

Similarity:

CONTENTSIntroduction...........................................................................51. Preliminaries.....................................................................6 1.1. Notation........................................................................6 1.2. Control systems. Strategies..........................................72. Main lemma......................................................................93. Avoidance of many pursuers..........................................14 3.1....

The even-odd hat problem

Daniel J. Velleman (2012)

Fundamenta Mathematicae

Similarity:

We answer a question of C. Hardin and A. Taylor concerning a hat-guessing game.

An axiomatization of the aspiration core

Hans Keiding (2006)

Banach Center Publications

Similarity:

The aspiration core of a TU game was introduced by Bennett [1] as a payoff vector which is undominated and achievable in the sense that each player belongs to a coalition which can obtain the specified payoff for its members, and which minimizes the distance to the set of aggregate feasible payoffs among all such payoff vectors. In the paper a set of axioms is proposed which characterize the aspiration core, which may be considered as an extension of the core to a much larger set of...

The Give and Take game: Analysis of a resource sharing game

Pedro Mariano, Luís Correia (2015)

International Journal of Applied Mathematics and Computer Science

Similarity:

We analyse Give and Take, a multi-stage resource sharing game to be played between two players. The payoff is dependent on the possession of an indivisible and durable resource, and in each stage players may either do nothing or, depending on their roles, give the resource or take it. Despite these simple rules, we show that this game has interesting complex dynamics. Unique to Give and Take is the existence of multiple Pareto optimal profiles that can also be Nash equilibria, and a...

Axiomatization of values of cooperative games using a fairness property

Andrzej Młodak (2005)

Applicationes Mathematicae

Similarity:

We propose new systems of axioms which characterize four types of values of cooperative games: the Banzhaf value, the Deegan-Packel value, the least square prenucleolus and the least square nucleolus. The common element used in these axiomatizations is a fairness property. It requires that if to a cooperative game we add another game in which two given players are symmetric, then their payoffs change by the same amount. In our analysis we will use an idea applied by R. van den Brink...

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...