Related papers: Boolean Hedonic Games
The game in which acts of participants don't have an adequate description in terms of Boolean logic and classical theory of probabilities is considered. The model of the game interaction is constructed on the basis of a non-distributive…
The preferences of players in non-cooperative games represent their choice in the set of available options, which meet the completeness property if players are able to compare any pair of available options. In the existing literature, the…
We re-examine the old question to what extent mathematics may be compared with a game. Mainly inspired by Hilbert and Wittgenstein, our answer is that mathematics is something like a rhododendron of language games, where the rules are…
We introduce the concept of an {\em operator decision making technique} and apply it to a concrete political problem: should a given political party form a coalition or not? We focus on the situation of three political parties, and divide…
The present study explores a problem that can be resolved by employing the notion of a partially defined cooperative game, yet cannot by using a restricted game. The following situation is considered: First, it is assumed that the worth of…
An active line of research has considered games played on networks in which payoffs depend on both a player's individual decision and also the decisions of her neighbors. Such games have been used to model issues including the formation of…
In this paper we introduce a qualitative decision and game theory based on belief (B) and desire (D) rules. We show that a group of agents acts as if it is maximizing achieved joint goals.
In a one-off Minority game, when a group of players agree to collaborate they gain an advantage over the remaining players. We consider the advantage obtained in a quantum Minority game by a coalition sharing an initially entangled state…
We model a dynamic public good contribution game, where players are (naturally) formed into groups. The groups are exogenously placed in a sequence, with limited information available to players about their groups' position in the sequence.…
A quantum game can be viewed as a state preparation in which the final output state results from the competing preferences of the players over the set of possible output states that can be produced. It is therefore possible to view state…
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…
Negotiations, a model of concurrency with multi party negotiation as primitive, have been recently introduced in arXiv:1307.2145, arXiv:1403.4958. We initiate the study of games for this model. We study coalition problems: can a given…
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…
Ensuring that AI systems make strategic decisions aligned with the specified preferences in adversarial sequential interactions is a critical challenge for developing trustworthy AI systems, especially when the environment is stochastic and…
A key challenge in the study of multiagent cooperation is the need for individual agents not only to cooperate effectively, but to decide with whom to cooperate. This is particularly critical in situations when other agents have hidden,…
Evolutionary game theory assumes that individuals maximize their benefits when choosing strategies. However, an alternative perspective proposes that individuals seek to maximize the benefits of others. To explore the relationship between…
The additively separable hedonic game (ASHG) is a model of coalition formation games on graphs. In this paper, we intensively and extensively investigate the computational complexity of finding several desirable solutions, such as a Nash…
Cooperative games can be distinguished as non-cooperative games in which players can freely sign binding agreements to form coalitions. These coalitions inherit a joint strategy set and seek to maximize collective payoffs. When the payoffs…
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…
Argumentation is one of the most popular approaches of defining a~non-monotonic formalism and several argumentation based semantics were proposed for defeasible logic programs. Recently, a new approach based on notions of conflict…