Hypercubes and compromise values for cooperative fuzzy games

90D12;03E72cooperative games

Monotonic Allocation Schemes in Clan Games

Total clan games are characterized using monotonicity, veto power of the clan members, and a concavity condition reflecting the decreasing marginal contribution of non-clan members to growing coalitions.This decreasing marginal contribution is incorporated in the notion of a bi-monotonic allocation scheme, where the value of each coalition is divided over its members in such a way that the clan members receive a higher, and the non-clan members a lower share as the coalitions grow larger.Each core element of a total clan game can be extended to both a population monotonic and a bi-monotonic allocation scheme.In total clan games where the clan consists of a single member (the so-called big boss) the use of the nucleolus as an allocation mechanism gives rise to a bi-monotonic allocation scheme.cooperative games;population monotonic allocation scheme;bi-monotonic allocation scheme;clan games;big boss games

Egalitarianism in convex fuzzy games

cooperative games;algorithm

On Cores and Stable Sets for Fuzzy Games

AMS classifications: 90D12; 03E72;cooperative games;decision making;fuzzy games

Cooperation under Interval Uncertainty

Classification: JEL code C71Cooperative game theory;Interval uncertainty;Core;Value;Balancedness

The approximate f-core and the utopia payoff for infinite assignment games

Assignment problems where both sets of agents are countably infinite, the so-called infinite assignment problems, are studied as well as the related assignment games. Further, two solutions for these games are studied. The first one is the approximate f-core for games with a finite value. This particular solution takes into account that due to organisational limitations only finite groups of agents can protest against proposals of profit distributions. Second, we study the utopia payoff, the perfect proposal in which each agent receives the maximal amount he can get. \u

How to Cope with Division Problems under Interval Uncertainty of Claims?

The paper deals with division situations where individual claims can vary within closed intervals.Uncertainty of claims is removed by compromising in a consistent way the upper and lower bounds of the claim intervals.Deterministic division problems with compromise claims are then considered and classical division rules from the bankruptcy literature are used to generate several procedures leading to e .cient and reasonable rules for division problems under interval uncertainty of claims.uncertainty;claims;division problems

Fuzzy Clan Games and Bi-monotonic Allocation Rules

Clan game;Big boss game;Core;Decision making;Fuzzy coalition;Fuzzy game;Monotonic allocation rule

Some Characterizations of Convex Interval Games

This paper focuses on two characterizations of convex interval games using the notions of superadditivity and exactness, respectively. We also relate big boss interval games with concave interval games and obtain characterizations of big boss interval games in terms of subadditivity and exactness.Cooperative interval games, convex games, big boss games, superadditive games, marginal games, exact games

Compromising in Partition Function Form Games and Cooperation in Perfect Extensive Form

In this paper reasonable payoff intervals for players in a game in partition function form (p.f.f.game) are introduced and used to define the notion of compromisable p.f.f. game.For a compromisable p.f.f. game a compromise value is defined for which an axiomatic characterization is provided.Also a generic subclass of games in extensive form of perfect information without chance moves is introduced.For this class of perfect extensive form games there is a natural credible way to define a p.f.f. game if the players consider cooperation.It turns out that the p.f.f. games obtained in this way are compromisable.game theory