AMS classification: 90D12

A competition which is based on the results of (partial) pairwise comparisons can be modelled by means of a directed graph.Given initial weights on the nodes in such digraph competitions, we view the measurement of the importance (i.e., the cardinal ranking) of the nodes as an allocation problem...

A highway problem is determined by a connected graph which provides all potential entry and exit vertices and all possible edges that can be constructed between vertices, a cost function on the edges of the graph and a set of players, each in need of constructing a connection between a specific...

AMS classifications: 90D12, 90B05.

This paper considers a special class of sequencing situations with two parallel machines in which each agent has precisely two jobs to be processed, one on each machine.The costs of an agent depend linearly on the final completion time of his jobs.We describe a procedure that provides an optimal...

This paper shows how problems in `non life'-insurance and `non life'-reinsurance can be modelled simultaneously as cooperative games with stochastic payoffs.Pareto optimal allocations of the risks faced by the insurers and the insureds are determined.It is shown that the core of the...

This paper focuses on sharing the costs and revenues of maintaining a public network communication structure.Revenues are assumed to be bilateral and communication links are publicly available but costly.It is assumed that agents are located at the vertices of an undirected graph in which the...

This paper is a reaction on Ginsburgh and Zang (2003).It reconsiders the problem where a group of museums offer a pass such that the owner can visit these museums an unlimited number of times during a fixed period of time.The problem addressed is how to share the total joint income of this pass...

AMS classifications: 90A15, 90D12.