18,070 research outputs found
Using a Cognitive Architecture for Opponent Target Prediction
One of the most important aspects of a compelling game AI is that it anticipates the playerâs actions and responds to them in a convincing manner. The first step towards doing this is to understand what the player is doing and predict their possible future actions. In this paper we show an approach where the AI system focusses on testing hypotheses made about the playerâs actions using an implementation of a cognitive architecture inspired by the simulation theory of mind. The application used in this paper is to predict the target that the player is heading towards, in an RTS-style game. We improve the prediction accuracy and reduce the number of hypotheses needed by using path planning and path clustering
A game theory framework for clustering
The Game Theory-based Multi-Agent System (GTMAS) of Toreyen and Salhi, [10] and [12], implements a loosely coupled hybrid algorithm that may involve any number of algorithms suitable, a priori, for the solution of a given optimisation problem. The system allows the available algorithms to co-operate toward the solution of the problem in hand as well as compete for the computing facilities they require to run. This co-operative/competitive aspect is captured through the implementation of the Prisoners? Dilemma paradigm of game theory. Here, we apply GTMAS to the problem of clustering European Union (EU) economies, including Turkey, to find out whether the latter, based on a number of criteria, can fit in the EU and find out which countries, if any, it has strong similaries with. This clustering problem is first converted into an optimisation problem, namely the Travelling Salesman Problem (TSP) before being solved with GTMAS involving two players (agents) each implementing a standard combinatorial optimisation algorithm. Computational results are included
On the Modeling of Musical Solos as Complex Networks
Notes in a musical piece are building blocks employed in non-random ways to
create melodies. It is the "interaction" among a limited amount of notes that
allows constructing the variety of musical compositions that have been written
in centuries and within different cultures. Networks are a modeling tool that
is commonly employed to represent a set of entities interacting in some way.
Thus, notes composing a melody can be seen as nodes of a network that are
connected whenever these are played in sequence. The outcome of such a process
results in a directed graph. By using complex network theory, some main metrics
of musical graphs can be measured, which characterize the related musical
pieces. In this paper, we define a framework to represent melodies as networks.
Then, we provide an analysis on a set of guitar solos performed by main
musicians. Results of this study indicate that the presented model can have an
impact on audio and multimedia applications such as music classification,
identification, e-learning, automatic music generation, multimedia
entertainment.Comment: to appear in Information Science, Elsevier. Please cite the paper
including such information. arXiv admin note: text overlap with
arXiv:1603.0497
Efficient Local Search in Coordination Games on Graphs
We study strategic games on weighted directed graphs, where the payoff of a
player is defined as the sum of the weights on the edges from players who chose
the same strategy augmented by a fixed non-negative bonus for picking a given
strategy. These games capture the idea of coordination in the absence of
globally common strategies. Prior work shows that the problem of determining
the existence of a pure Nash equilibrium for these games is NP-complete already
for graphs with all weights equal to one and no bonuses. However, for several
classes of graphs (e.g. DAGs and cliques) pure Nash equilibria or even strong
equilibria always exist and can be found by simply following a particular
improvement or coalition-improvement path, respectively. In this paper we
identify several natural classes of graphs for which a finite improvement or
coalition-improvement path of polynomial length always exists, and, as a
consequence, a Nash equilibrium or strong equilibrium in them can be found in
polynomial time. We also argue that these results are optimal in the sense that
in natural generalisations of these classes of graphs, a pure Nash equilibrium
may not even exist.Comment: Extended version of a paper accepted to IJCAI1
Complex network analysis and nonlinear dynamics
This chapter aims at reviewing complex network and nonlinear dynamical
models and methods that were either developed for or applied to socioeconomic
issues, and pertinent to the theme of New Economic Geography. After an introduction
to the foundations of the field of complex networks, the present summary
introduces some applications of complex networks to economics, finance, epidemic
spreading of innovations, and regional trade and developments. The chapter also
reviews results involving applications of complex networks to other relevant
socioeconomic issue
- âŠ