Alternative Axiomatic Characterizations of the Grey Shapley Value

Authors

  • Alparslan Gok, Sirma Zeynep Süleyman Demirel University, Faculty of Arts and Sciences, Department of Mathematics, 32260 Isparta, Turkey
  • Olgun, Mehmet Onur Süleyman Demirel University, Faculty of Arts and Sciences, Department of Mathematics, 32260 Isparta, Turkey
  • Palanci, Osman Süleyman Demirel University, Faculty of Arts and Sciences, Department of Mathematics, 32260 Isparta, Turkey
Abstract:

The Shapley value, one of the most common solution concepts of cooperative game theory is defined and axiomatically characterized in different game-theoretic models. Certainly, the Shapley value can be used in interesting sharing cost/reward problems in the Operations Research area such as connection, routing, scheduling, production and inventory situations. In this paper, we focus on the Shapley value for cooperative games, where the set of players is finite and the coalition values are interval grey numbers. The central question in this paper is how to characterize the grey Shapley value. In this context, we present two alternative axiomatic characterizations. First, we characterize the grey Shapley value using the properties of efficiency, symmetry and strong monotonicity. Second, we characterize the grey Shapley value by using the grey dividends.

Upgrade to premium to download articles

Sign up to access the full text

Already have an account?login

similar resources

alternative axiomatic characterizations of the grey shapley value

the shapley value, one of the most common solution concepts of cooperative game theory is defined and axiomatically characterized in different game-theoretic models. certainly, the shapley value can be used in interesting sharing cost/reward problems in the operations research area such as connection, routing, scheduling, production and inventory situations. in this paper, we focus on the shapl...

full text

Axiomatic Scalable Neurocontroller Analysis via the Shapley Value

One of the major challenges in the field of neurally driven evolved autonomous agents is deciphering the neural mechanisms underlying their behavior. Aiming at this goal, we have developed the multi-perturbation Shapley value analysis (MSA)--the first axiomatic and rigorous method for deducing causal function localization from multiple-perturbation data, substantially improving on earlier appro...

full text

Players indifferent to cooperate and characterizations of the Shapley value

In this paper we provide new axiomatizations of the Shapley value for TU-games using axioms that are based on relational aspects in the interactions among players. Some of these relational aspects, in particular the economic or social interest of each player in cooperating with each other, can be found embedded in the characteristic function. We define a particular relation among the players th...

full text

Non-Cooperative and Axiomatic Characterizations of the Average Lexicographic Value

We give a non-cooperative and an axiomatic characterization of the Average Lexicographic value (AL-value) on the class of balanced games. The AL-value is a single-valued solution for balanced TUgames. It is defined as the average of lexicographic maximum of the core of the game with respect to all orders on the player set, and it can be seen as a core selection based on the priority orders on t...

full text

Axiomatic characterizations of generalized values

In the framework of cooperative game theory, the concept of generalized value, which is an extension of that of value, has been recently proposed to measure the overall influence of coalitions in games. Axiomatizations of two classes of generalized values, namely probabilistic generalized values and generalized semivalues, which extend probabilistic values and semivalues, respectively, are firs...

full text

Axiomatic Characterizations of Information Measures

Axiomatic characterizations of Shannon entropy, Kullback I-divergence, and some generalized information measures are surveyed. Three directions are treated: (A) Characterization of functions of probability distributions suitable as information measures. (B) Characterization of set functions on the subsets of {1, . . . , N} representable by joint entropies of components of an N -dimensional rand...

full text

My Resources

Save resource for easier access later

Save to my library Already added to my library

{@ msg_add @}


Journal title

volume 1  issue 1

pages  69- 80

publication date 2014-05

By following a journal you will be notified via email when a new issue of this journal is published.

Keywords

No Keywords

Hosted on Doprax cloud platform doprax.com

copyright © 2015-2023