Related papers: Computability of simple games: A characterization …
In this article, we introduce certain kinds of computable reduction games with imperfect information. One can view such a game as an extension of the notion of Turing reduction, and generalized Weihrauch reduction as well. Based on the work…
In this paper, some new criteria for detecting whether a finite game is potential are proposed by solving potential equations. The verification equations with the minimal number for checking a potential game are obtained for the first time.…
We propose a class of cooperative games, called d Partitioned Compbinatorial Optimization Games (PCOGs). The input of PCOG consists of a set of agents and a combinatorial structure (typically a graph) with a fixed optimization goal on this…
One of the basics tasks in computer systems is the control of access of resources. Basically, there is a finite amount of resources that can be, for example, the CPU, memory or I/O ports, and several processes requiring those resources. If…
We present a new model of incomplete information games without private information in which the players use a distributionally robust optimization approach to cope with the payoff uncertainty. With some specific restrictions, we show that…
Incomplete cooperative games generalise the classical model of cooperative games by omitting the values of some of the coalitions. This allows to incorporate uncertainty into the model and study the underlying games as well as possible…
The class of exact transferable utility coalitional games, introduced in 1972 by Schmeidler, has been studied both in the context of game theory and in the context of imprecise probabilities. We characterize the cone of exact games by…
A finite graph with an assignment of non-negative integers to vertices gives chip-firing games. Chip-firing games determine languages (sets of words) called the record sets of legal games. Bj\"orner, Lov\'asz and Shor found several…
In this paper, we introduce an agent-based representation of games, in order to propose a compact representation for multi-party games in game theory. Our method is inspired by concepts in process theory and process algebra. In addition, we…
Absolute combinatorial game theory was recently developed as a unifying tool for constructive/local game comparison (Larsson et al. 2018). The theory concerns {\em parental universes} of combinatorial games; standard closure properties are…
In computability theory and computable analysis, finite programs can compute infinite objects. Presenting a computable object via any program for it, provides at least as much information as presenting the object itself, written on an…
In this note we develop a generalisation of the $\lambda$-Core solution for non-cooperative games in normal form. We show that this generalised $\lambda$-Core is non-empty for the class of separable games that admit a socially optimal Nash…
We investigate the computability of algebraic closure and definable closure with respect to a collection of formulas. We show that for a computable collection of formulas of quantifier rank at most $n$, in any given computable structure,…
We introduce a new class of totally balanced cooperative TU games, namely p -additive games. It is inspired by the class of inventory games that arises from inventory situations with temporary discounts (Toledo, 2002) and contains the class…
We study minimum integer representations of weighted games, i.e., representations where the weights are integers and every other integer representation is at least as large in each component. Those minimum integer representations, if the…
Traditionally social sciences are interested in structuring people in multiple groups based on their individual preferences. This pa- per suggests an approach to this problem in the framework of a non- cooperative game theory. Definition of…
The focus of this essay is a rigorous treatment of infinite games. An infinite game is defined as a play consisting of a fixed number of players whose sequence of moves is repeated, or iterated ad infinitum. Each sequence corresponds to a…
Arrow's Impossibility Theorem establishes bounds on what we can require from voting systems. Given satisfaction of a small collection of "fairness" axioms, it shows votes can only exist as dictatorships in which one voter determines all…
We consider dynamic cooperative games, where the worth of coalitions varies over time according to the history of allocations. When defining the core of a dynamic game, we allow the possibility for coalitions to deviate at any time and…
In this paper, we consider a generalization of cooperative games to the case where a coalition can distribute the earned utility not only among its members but also to other players. In particular, we consider an example where coalitions…