In this paper we propose a new method to associate a coalitional game with each strategic game. The method is based on the lower value of matrix games. We axiomatically characterize this new method, as well as the method that was described in von Neumann and Morgenstern (1944). As an intermediate step, we provide some axiomatic characterizations of the value and the lower value of matrix games.

The joint resource block (RB) allocation and power optimization problem is studied to maximize the sum-rate of vehicle-to-vehicle (V2V) links in device-to-device (D2D)-enabled V2V communication system, where one feasible cellular user (FCU) can share its RB with multiple pairs. first formulated as a nonconvex mixed-integer nonlinear programming (MINLP) constraint maximum interference FCU links....

The analysis of single-valued solution concepts for coalitional games with transferable utilities has a long tradition. Opposed to most of this literature we will not deal with solution concepts that provide payoffs to the players for the grand coalition only, but we will analyze allocation scheme rules, which assign payoffs to all players in all coalitions. We introduce four closely related al...

We present and study the contribution-selection algorithm (CSA), a novel algorithm for feature selection. The algorithm is based on the multiperturbation shapley analysis (MSA), a framework that relies on game theory to estimate usefulness. The algorithm iteratively estimates the usefulness of features and selects them accordingly, using either forward selection or backward elimination. It can ...

In this paper we study the relations between superadditivity and several types of convexity for cooperative games with random payoffs. The types of convexity considered are marginal convexity (all marginal vectors belong to the core), individual-merge convexity (any individual player is better off joining a larger coalition) and coalitional-merge convexity (any coalition of players is better of...

We deal with the problem of how to extend a preference relation over a set X of “objects” to the set of all subsets of X . This problem has been carried out in the tradition of the literature on extending an order on a set to its power set with the objective to analyze the axiomatic structure of families of rankings over subsets. In particular, most of these approaches make use of axioms aimed ...

We consider various lexicographic allocation procedures for coalitional games with transferable utility where the payoffs are computed in an externally given order of the players. The common feature of the methods is that if the allocation is in the core, it is an extreme point of the core. We first investigate the general relationships between these allocations and obtain two hierarchies on th...