Similar Search Results

Harsanyi Power Solutions for Graph-Restricted Games

Brink, René van den; Laan, Gerard van der; Pruzhansky, … - 2004

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 distributions (possibly empty or consisting of a unique element) to every...

Persistent link: https://www.econbiz.de/10014028984

On the Extreme Points of Two Polytopes Associated with a Digraph and Applications to Cooperative Games

van den Brink, René; van der Laan, Gerard; Vasil'ev, … - 2004

In this paper we describe the extreme points of two closely related polytopes that are assigned to a digraph. The first polytope is the set of all sharing vectors (elements from the unit simplex) such that each node gets at least as much as each of its successors. The second one is the set of...

Persistent link: https://www.econbiz.de/10014029186

The Core of an Extended Tree Game : A New Characterisation

Schnurbein, Barbara von - 2010

. But, modern networks have also the capacity to supply different (levels of) services. For example, a cable network that …Cost allocation problems on networks can be interpreted as cooperative games on a graph structure. In the classical …

Persistent link: https://www.econbiz.de/10013136112

A Technical Note on Lorenz Dominance in Cooperative Games

Brânzei, Rodica - 2010

In this paper we provide some technical results related to the Lorenz dominance, which allow to prove that the allocation obtained by the algorithm in Dutta and Ray (1989), when exists, and the elements of the equal split-off set always Lorenz dominate every allocation in the core of the game

Persistent link: https://www.econbiz.de/10013137212

Between the Prekernel and the Prenucleolus

Katsev, Ilya V. - 2010

A collection of TU games solutions intermediate between the prekernel and the prenucleolus is considered. Each solution from the collection is parametrized by a positive integer k 1 and is called the k-prekernel for properties extending those verifying by the prekernel such that the 2-prekernel...

Persistent link: https://www.econbiz.de/10013143113

Cooperative Games with Incomplete Information : Some Open Problems

Forges, Françoise - 2011

This is a brief survey describing some of the recent progress and open problems in the area of cooperative games with incomplete information. We discuss exchange economies, cooperative Bayesian games with orthogonal coalitions, and issues of cooperation in non-cooperative Bayesian games

Persistent link: https://www.econbiz.de/10013117753

Competitive Outcomes and the Inner Core of NTU Market Games

Brangewitz, Sonja - 2012

We consider the inner core as a solution concept for cooperative games with non-transferable utility (NTU) and its relationship to competitive equilibria of markets that are induced by an NTU game. We investigate the relationship between certain subsets of the inner core for NTU market games and...

Persistent link: https://www.econbiz.de/10013108817

Convex Games Versus Clan Games

Brânzei, Rodica - 2010

In this paper we provide characterizations of convex games and total clan games by using properties of their corresponding marginal games. We show that a "dualize and restrict" procedure transforms total clan games with zero worth for the clan into monotonic convex games. Furthermore, each...

Persistent link: https://www.econbiz.de/10013150483

Weighted and Roughly Weighted Simple Games

Gvozdeva, Tatiana - 2009

This paper contributes to the program of numerical characterisation and classification of simple games outlined in the classical monograph of von Neumann and Morgenstern (1944). One of the most fundamental questions of this program is what makes a simple game a weighted majority game. The...

Persistent link: https://www.econbiz.de/10013152942

The Position Value for Partition Function Form Network Games

van den Nouweland, Anne - 2013

We use the axiomatization of the position value for network situations in van den Nouweland and Slikker (2012) to … define a position value for partition function form network situations by generalizing the axioms to the partition function … satisfying these axioms. We call this allocation rule the position value for partition function form network situations …

Persistent link: https://www.econbiz.de/10013081872