A shapley value for games with authorization structure

0Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

A cooperative TU-game consists of a set of players and a characteristic function which determines the maximal gain or minimal cost that every subset of players can achieve when they decide to cooperate, regardless of the actions that the other players take. It is often assumed that the players are free to participate in any coalition, but in some situations there are dependency relationships among the players that restrict their capacity to cooperate within some coalitions. Those relationships must be taken into account if we want to distribute the profits fairly. To do this, several models have been introduced in literature. In this chapter we describe one of those models for games with restricted cooperation. This model is more general than others in several ways. For instance, it allows us to deal with non-hierarchical or non-transitive dependency relationships. In addition, it can be adapted to consider fuzzy dependency relationships, which arise in situations in which each player has a degree of freedom to cooperate within a coalition.

Cite

CITATION STYLE

APA

Gallardo, J. M., Jiménez, N., & Jiménez-Losada, A. (2018). A shapley value for games with authorization structure. In Contributions to Management Science (pp. 323–348). Springer. https://doi.org/10.1007/978-3-319-61603-2_15

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free