In this paper we use defense trees, an extension of attack trees with countermeasures, to
represent attack scenarios and game theory to detect the most promising actions attacker and …

An optimality criterion for fair division theory, introduced by Dubins and Spanier in 1961, is
recalled with the purpose of analyzing its structure in relationship with other optimal solutions (…

For fair-division or cake-cutting problems with value functions which are normalized positive
measures (ie, the values are probability measures) maximin-share and minimax-envy …

In this paper we consider the classical problem of dividing a land among many agents so
that everybody is satisfied with the parcel she receives. In the literature, it is usually assumed …

We consider the problem of allocating a finite number of indivisible items to two players with
additive utilities. We design a procedure that looks for all the maximin allocations and makes …

… By using a simple characterization contained in Dall’Aglio and Scarsini (2001), we can
interpret these zonoids as ranges of suitable nonatomic vector measures. For instance, given a …

We define a subgradient algorithm to compute the maxmin value of a completely divisible
good in both competitive and cooperative strategic contexts. The algorithm relies on the …

Abstract The duality results and the computational tools developed within the theory of linear
semi-infinite optimization can be successfully applied to several problems in probability and …

In this paper, we analyze the order of criticality in simple games, under the light of minimal
winning coalitions. The order of criticality of a player in a simple game is based on the minimal …

The gastronomic interpretation of this scenario goes as follows: There is a cake S to be
divided among n players, represents the family of all possible pieces of the cake, and νi (A) …