Given any α ∈ [0, 1], an α-constant-sum game on a finite set of players, N, is a function that assigns a real number to any coalition S ⊆ N, such that the sum of the worth of the coalition S and the worth of its complementary coalition N\S is α times of the worth of the grand coalition....

A situation in which a finite set of players can obtain certain payoffs by cooperation can be described by a cooperative game with transferable utility, or simply a TU-game. A solution for TU-games assigns a set of payoff vectors to every TU-game. Some solutions that are based on distributing...

In a liability problem, the asset value of an insolvent firm must be distributed among the creditors and the firm itself, when the firm has some freedom in negotiating with the creditors. We model the negotiations using cooperative game theory and analyze the Shapley value to resolve such...

Agents participating in different kind of organizations, usually take different positions in some network structure. Two well-known network structures are hierarchies and communication networks. We give an overview of the most common models of communication and hierarchy restrictions in...

Approval voting allows voters to list any number of candidates. Their scores are obtained by summing the votes cast in their favor. Fractional voting instead follows the One-person-one-vote principle by endowing voters with a single vote that they may freely distribute among candidates. In this...

In this paper we focus on restrictions arising from the players belonging to some hierarchical structure that is represented by a digraph. Two of these models are the games with a permission structure and games under precedence constraints. In both cases, the hierarchy can be represented by a...

Different axiomatic systems for the Shapley value can be found in the literature. For games with a coalition structure, the Shapley value also has been axiomatized in several ways. In this paper, we discuss a generalization of the Shapley value to the class of partition function form games. The...

In general, analyses of voting power are performed through the notion of a simple voting game (SVG) in which every voter can choose between two options: 'yes' or 'no'. Felsenthal and Machover (1997) introduced the concept of ternary voting games (TVGs) which recognizes abstention alongside. They...

A new model of TU game is introduced and studied. Here apart from the characteristic function, two additional functions are used: relations between the players and the probability of coalition formation. We suggest and study the sufficient properties of the probability function to transform it...

This chapter surveys a class of solution concepts for n -person games without transferable utility — NTU games for short — that are based on varying notions of “fair division”. An NTU game is a specification of payoffs attainable by members of each coalition through some joint course of...