In this paper we study the collusion in Knaster’s procedure, starting from the paper of Fragnelli and Marina (2009). First, we introduce a suitable dynamic mechanism, so that the coalition enlargement is always non-disadvantageous. Then, we define a new class of TU-games in order to evaluate...

The Knaster’s procedure is one of the simplest and most powerful mechanisms for allocating indivisible objects among agents requiring them, but its sealed bid feature may induce some agents in altering their valuations. In this paper we study the consequences of false declarations on the...

In this note we represent a classical bankruptcy problem as a standard flow problem on a simple network and implement some known division rules from the bankruptcy literature via suitable cost functions in the related minimum cost flow problem.

In a game theoretical setting it is possible to assign a relative measurement of the skill required to each player for maximizing his payoff in a casino game; according to this approach we analyze the relevance of skill and chance in an insurance contract, both for the insurance company and for...

Recently, a new family of power indices, the FP, was introduced by Fragnelli, Ottone and Sattanino (2009), requiring that the parties of a majority are ideologically contiguous along a left-right axis. The different choices of some parameters allow representing various situations, resulting in...