Related papers: The game of go as a complex network

Any collection can be ranked. Sports and games are common examples of ranked systems: players and teams are constantly ranked using different methods. The statistical properties of rankings have been studied for almost a century in a…

Exciting contemporary machine learning problems have recently been phrased in the classic formalism of tree search -- most famously, the game of Go. Interestingly, the state-space underlying these sequential decision-making problems often…

In previous work on higher-order games, we accounted for finite games of unbounded length by working with continuous outcome functions, which carry implicit game trees. In this work we make such trees explicit. We use concepts from…

In this paper we discuss the diffusion of serious games and present reasons for why Rogers traditional approach is limited in this context. We present an alternative overview through the characteristics of relative advantage, compatibility,…

We propose a simple stochastic model describing the position-dependent ball-passing network in football games. In this network, a player on a certain area in the divided fields is a node, and a pass between two nodes corresponds to an edge.…

We analyze complex networks under random matrix theory framework. Particularly, we show that $\Delta_3$ statistic, which gives information about the long range correlations among eigenvalues, provides a qualitative measure of randomness in…

Lookahead search is perhaps the most natural and widely used game playing strategy. Given the practical importance of the method, the aim of this paper is to provide a theoretical performance examination of lookahead search in a wide…

We study public goods games played on networks with possibly non-reciprocal relationships between players. Examples for this type of interactions include one-sided relationships, mutual but unequal relationships, and parasitism. It is well…

Iterated admissibility is a well-known and important concept in classical game theory, e.g. to determine rational behaviors in multi-player matrix games. As recently shown by Berwanger, this concept can be soundly extended to infinite games…

The laws of chance are often subtle and deceptive. This is why games of chance work. People are convinced that they obey seemingly intuitive laws, while the underlying mathematical structure reveals a different and more complex reality.…

Many networks are used to transfer information or goods, in other words, they are navigated. The larger the network, the more difficult it is to navigate efficiently. Indeed, information routing in the Internet faces serious scalability…

Link directions are essential to the functionality of networks and their prediction is helpful towards a better knowledge of directed networks from incomplete real-world data. We study the problem of predicting the directions of some links…

Distributed adaptive filtering has been considered as an effective approach for data processing and estimation over distributed networks. Most existing distributed adaptive filtering algorithms focus on designing different information…

Network models have been widely used to study diverse systems and analyze their dynamic behaviors. Given the structural variability of networks, an intriguing question arises: Can we infer the type of system represented by a network based…

Strategic classification studies the design of a classifier robust to the manipulation of input by strategic individuals. However, the existing literature does not consider the effect of competition among individuals as induced by the…

A recent body of experimental literature has studied empirical game-theoretical analysis, in which we have partial knowledge of a game, consisting of observations of a subset of the pure-strategy profiles and their associated payoffs to…

Graph games of infinite length are a natural model for open reactive processes: one player represents the controller, trying to ensure a given specification, and the other represents a hostile environment. The evolution of the system…

The article considers strategies of coalitions that are based on intelligence information about moves of some of the other agents. The main technical result is a sound and complete logical system that describes the interplay between…

This paper deals with modeling of network's dynamic using evolutionary games approach. Today there are many different protocols for data transmission through the Internet, providing users with better or worse service. The process of…

Learning in games provides a powerful framework to design control policies for self-interested agents that may be coupled through their dynamics, costs, or constraints. We consider the case where the dynamics of the coupled system can be…