The concept of 'the core' originates in cooperative game theory and its introduction to economics in the 1960s as a basis for proofs of existence of general equilibrium is one of the earliest attempts to use game theory to address big questions in economics. Discovery of the core was met with...

We consider a generalization of the Minimum Cost Spanning Tree (MCST) model dubbed the Minimum Cost Connection Network (MCCN) model, where network users have connection demands in the form of a pair of target nodes they want connected directly, or indirectly. Given a network which satisfies all...

Recently, cooperative game theory has been applied to various economic allocation problems in which players are not fully anonymous but belong to some relational structure. One of the most developed models in this respect are communications situations or (symmetric) network situations in which...

In this paper we establish a relationship between the core cover of a compromise admissiblegame and the core of a particular bankruptcy game: the core cover of a compromiseadmissible game is, indeed, a translation of the set of coalitional stable allocations capturedby an associated bankruptcy...

A matching game is a cooperative game (N; v) defined on a graph G = (N;E) with an edge weighting w : E ! R+. The player set is N and the value of a coalition S N is defined as the maximum weight of a matching in the subgraph induced by S. First we present an O(nm+n2 log n) algorithm that tests...

An electrical transmission network consists of producers, consumers and the power lines connecting them. We build an ideal (lossless) DC load flow model as a cooperative game over a graph with the producers and consumers located at the nodes, each described by a maximum supply or desired demand...

The stable roommates problem with payments has as input a graph G(E,V) with an edge weighting w:E_ùR+ and the problem is to find a stable solution. A solution is a matching M with a vector p.RV that satisfies pu+pv=w(uv) for all uv.M and pu=0 for all u unmatched in M. A solution is stable if it...

The purpose of this paper is to introduce a novel family of games related to congested networks. Traffic routing has been extensively analyzed from the non-cooperative aspect. A common assumption is that each individual optimizes his route in the network selfishly. However looking at the same...