In this paper we study cooperative games with limited cooperation possibilities, representedby an undirected cycle-free communication graph. Players in the game can cooperate if andonly if they are connected in the graph, i.e. they can communicate with one another. Weintroduce a new...

We study cooperative games with communication structure, represented by an undirectedgraph. Players in the game are able to cooperate only if they can form a network in the graph. A single-valued solution, the average tree solution, is proposed for this class ofgames. Given the graph structure...

We provide two new characterizations of exact games. First, a game is exact if and only if it is exactly balanced; and second, a game is exact if and only if it is totally balanced and overbalanced. The condition of exact balancedness is identical to the one of balancedness, except that one of the...

This paper presents a complete survey of the use of homotopy methods in game theory.Homotopies allow for a robust computation of game-theoretic equilibria and their refinements. Homotopies are also suitable to compute equilibria that are selected by variousselection theories. We present all...

Our work contributes to the game-theoretic analysis of bargaining by providing additional non-cooperative support to the well-known Nash bargaining solution. In particular, in the present paper we study a model of non-cooperative multilateral bargaining with a very general proposer selection...

We investigate the algorithmic performance of Vickrey-Clarke-Groves mechanisms in the single item case. We provide a formal definition of a Vickrey algorithm for this framework, and give a number of examples of Vickrey algorithms. We consider three performance criteria, one corresponding to a...

In this paper a typical situation arising in the assembly of printed circuit boards is investigated. The planning problem we face is how to assemble boards of different types using a single line of placement machines. From a practical viewpoint, the multiplicity of board types adds significantly...

More often than not production processes are the joint endeavor of people having different abilities and productivities. Such production processes and the associated surplus production are often not fully transparent in the sense that the relative contributions of involved agents are blurred;...

We present constant approximative policies for preemptive stochastic scheduling. We derive policies with a guaranteed performance ratio of 2 for scheduling jobs with release dates on identical parallel machines subject to minimizing the sum of weighted completion times. Our policies as well as...

It is well known that competitive analysis yields results that do not reflect the observed performance of online paging algorithms. Many deterministic paging algorithms achieve the same competitive ratio, ranging from inefficient strategies as flush-when-full to the well-performing...