Related papers: Asymmetric cut and choose games
This work introduces the concept of Variable Size Game Theory (VSGT), in which the number of players in a game is a strategic decision made by the players themselves. We start by discussing the main examples in game theory: dominance,…
The computation of a solution concept of a cooperative game usually employs values of all coalitions. However, in some applications, the values of some of the coalitions might be unknown due to high costs associated with their determination…
We provide here an epistemic analysis of arbitrary strategic games based on the possibility correspondences. Such an analysis calls for the use of transfinite iterations of the corresponding operators. Our approach is based on Tarski's…
We propose a general class of symmetric games called position-optimization games. Given a probability distribution $Q$ over a set of targets $\mathcal{Y}$, the $n$ players each choose a position in a space $\mathcal{X}$. A player's utility…
We investigate the dynamics of coordination and consensus in an agent population. Considering agents endowed with bounded rationality, we study asymmetric coordination games using a mapping to random field Ising models. In doing so, we…
We derive multiparty games that, if the winning chance exceeds a certain limit, prove the incompatibility of the parties' causal relations with any partial order. This, in turn, means that the parties exert a back-action on the causal…
In this paper, we consider a game beginning with a multiset of elements from a group. On a move, two elements are replaced by their sum. This is a no strategy game, and can be modeled as a graded poset with the rank of a node equal to the…
Patterns of wins and losses in pairwise contests, such as occur in sports and games, consumer research and paired comparison studies, and human and animal social hierarchies, are commonly analyzed using probabilistic models that allow one…
Strategic decision-making in uncertain and adversarial environments is crucial for the security of modern systems and infrastructures. A salient feature of many optimal decision-making policies is a level of unpredictability, or randomness,…
We compare two different ways of quantization a simple sequential game Cat's Dilemma in the context of the debate on intransitive and transitive preferences. This kind of analysis can have essential meaning for the research on the…
We present a new class of strategic games, mixed capability games, as a foundation for studying how different player capabilities impact the dynamics and outcomes of strategic games. We analyze the impact of different player capabilities…
We study a complementarity game as a systematic tool for the investigation of the interplay between individual optimization and population effects and for the comparison of different strategy and learning schemes. The game randomly pairs…
In repeated-game applications where both the collusive and non-collusive outcomes can be supported as equilibria, researchers must resolve underlying selection questions if theory will be used to understand counterfactual policies. One…
Choice functions constitute a simple, direct and very general mathematical framework for modelling choice under uncertainty. In particular, they are able to represent the set-valued choices that typically arise from applying decision rules…
The preference graph is a combinatorial representation of the structure of a normal-form game. Its nodes are the strategy profiles, with an arc between profiles if they differ in the strategy of a single player, where the orientation…
We introduce operational semantics into games. And based on the operational semantics, we establish a full algebra of games, including basic algebra of games, algebra of concurrent games, recursion and abstraction. The algebra can be used…
Let P be the direct product of countably many copies of the additive group Z of integers. We study, from a set-theoretic point of view, those subgroups of P for which all homomorphisms to Z annihilate all but finitely many of the standard…
Parity games play a central role in model checking and satisfiability checking. Solving parity games is computationally expensive, among others due to the size of the games, which, for model checking problems, can easily contain $10^9$…
We analyze combinatorial optimization problems over a pair of random point sets of equal cardinal. Typical examples include the matching of minimal length, the traveling salesperson tour constrained to alternate between points of each set,…
We consider games in which players search for a hidden prize, and they have asymmetric information about the prize location. We study the social payoff in equilibria of these games. We present sufficient conditions for the existence of an…