Related papers: Classifying Permutations under Context-Directed Sw…
In order to coordinate players in a game must first identify a target pattern of behaviour. In this paper we investigate the difficulty of identifying prominent outcomes in two kinds of binary action coordination problems in social…
Promoting behavioural diversity is critical for solving games with non-transitive dynamics where strategic cycles exist, and there is no consistent winner (e.g., Rock-Paper-Scissors). Yet, there is a lack of rigorous treatment for defining…
We study a sequential coin-flipping game in which a player starts with~$n$ coins, each landing heads independently with probability~$p$. In each round the player flips all remaining coins and must set aside at least one coin showing heads;…
We introduce a two-player game, in which each player extends a given sequence by picking a free element in a domain D of the real line. The aim of the players is to control the parity of the number of transpositions necessary to put the…
With remarkable significance in migration prediction, global disease mitigation, urban planning and many others, an arresting challenge is to predict human mobility fluxes between any two locations. A number of methods have been proposed…
Experiments on the ultimatum game have revealed that humans are remarkably fond of fair play. When asked to share an amount of money, unfair offers are rare and their acceptance rate small. While empathy and spatiality may lead to the…
We study zero-sum differential games with state constraints and one-sided information, where the informed player (Player 1) has a categorical payoff type unknown to the uninformed player (Player 2). The goal of Player 1 is to minimize his…
In distributed machine learning, data is dispatched to multiple machines for processing. Motivated by the fact that similar data points often belong to the same or similar classes, and more generally, classification rules of high accuracy…
Evolutionary game theory classically investigates which behavioral patterns are evolutionarily successful in a single game. More recently, a number of contributions have studied the evolution of preferences instead: which subjective…
We study the complexity of solving two-player infinite duration games played on a fixed finite graph, where the control of a node is not predetermined but rather assigned randomly. In classic random-turn games, control of each node is…
We study the conditions under which the iterated elimination of strictly dominated strategies is order independent and we identify a class of discontinuous games for which order does not matter. In this way, we answer the open problem…
We study a class of location games where players want to attract as many resources as possible and pay a cost when deviating from an exogenous reference location. This class of games includes political competitions between policy-interested…
We propose a novel decision making framework for forming potential collaboration among otherwise competing agents in subsurface systems. The agents can be, e.g., groundwater, CO$_2$, or hydrogen injectors and extractors with conflicting…
We study turn-based stochastic zero-sum games with lexicographic preferences over reachability and safety objectives. Stochastic games are standard models in control, verification, and synthesis of stochastic reactive systems that exhibit…
We give a bijection between permutations of length 2n and certain pairs of Dyck paths with labels on the down steps. The bijection arises from a game in which two players alternate selecting from a set of 2n items: the permutation encodes…
Sorting is one of the most used and well investigated algorithmic problem [1]. Traditional postulation supposes the sorting data archived, and the elementary operation as comparisons of two numbers. In a view of appearance of new processors…
Decentralized optimization of distributed stochastic differential systems has been an active area of research for over half a century. Its formulation utilizing static team and person-by-person optimality criteria is well investigated.…
We consider the problem of learning stable matchings with unknown preferences in a decentralized and uncoordinated manner, where "decentralized" means that players make decisions individually without the influence of a central platform, and…
Rank aggregation with pairwise comparisons is widely encountered in sociology, politics, economics, psychology, sports, etc . Given the enormous social impact and the consequent incentives, the potential adversary has a strong motivation to…
The iterated prisoner's dilemma is a game that produces many counter-intuitive and complex behaviors in a social environment, based on very simple basic rules. It illustrates that cooperation can be a good thing even in a competitive world,…