Existence of Fuzzy Zhou Bargaining Sets in TU Fuzzy Games

Existence of Fuzzy Zhou Bargaining Sets in TU Fuzzy Games

Wenbo Yang (Department of Trace Examination, National Police University of China, Shengyang, China), Jiuqiang Liu (Department of Mathematics, Eastern Michigan University, Ypsilanti, MI, USA) and Xiaodong Liu (School of Management Engineering, Xi'an University of Finance and Economics, Xi'an, China)
Copyright: © 2018 |Pages: 10
DOI: 10.4018/IJFSA.2018010104

Abstract

This article contends that cooperative games have been studied extensively in the literature. A central question in cooperative games is to study solution concepts and their relationships, those well-known solution concepts include cores, stable sets, Shapley values, bargaining sets, and so on. In 1981, Aubin introduced cooperative fuzzy games with fuzzy coalitions which reflect the situations where agents have the possibility to cooperate with different participation level with values between $0$ and $1$), varying from non-cooperation (participation level $0$) to full cooperation (participation level $1$). Since then, cooperative fuzzy games have been studied extensively in the literature. In this article, the authors extend the concept of Zhou bargaining sets - one of three major bargaining sets in cooperative games - to its fuzzy version and prove the existence of fuzzy Zhou bargaining sets which extends the existence theorem for Zhou bargaining sets by Zhou.
Article Preview
Top

1. Introduction

Let IJFSA.2018010104.m01 be the set of n players. Any subset of N is called a coalition.

We first recall some basic concepts given in Zhou (1994). For a coalition S and a vector IJFSA.2018010104.m02, we denote IJFSA.2018010104.m03.

1.1. Definition 1.1

An n-person game V is with transferable utility (a TU game or cooperative game in coalition form) if there exists a function IJFSA.2018010104.m04 such that for every IJFSA.2018010104.m05, IJFSA.2018010104.m06.

Thus, every TU game V has an underlying function v.

Cooperative games have been studied extensively in the literature. A central question in cooperative games is to study solution concepts and their relationships, those well-known solution concepts include core, stable set, Shapley value, bargaining set, and so on. There are three major types of bargaining sets: the first one, called classical bargaining set and denoted by IJFSA.2018010104.m07, is defined by R. J. Aumann and M. Maschler in 1964; the second one, denoted by MB, is given by Mas-Colell in 1989; and the third one is given by Zhou in 1994. The existence theorem for the Aumann-Maschler bargaining set has been established independently by Davis and Maschler (1963) and Peleg (1963), the existence for Mas-Colell bargaining set in a weakly superadditive TU game has been provided by Vohra (1991), and the existence of Zhou bargaining set for a TU game is given by Zhou (1994).

Our focus in this paper is on fuzzy Zhou bargaining sets. Let us first recall the concept of Zhou bargaining set. A payoff configuration of a TU game V is a pair IJFSA.2018010104.m08, where x is a vector in IJFSA.2018010104.m09, IJFSA.2018010104.m10 is a partition of N, and IJFSA.2018010104.m11 for each IJFSA.2018010104.m12. Then the set of all payoff configurations is:

IJFSA.2018010104.m13
(1.1) where P is the set of all partitions of N.

Clearly, C is nonempty, closed, comprehensive, bounded from above, and contains the origin (i.e., zero vector) as an interior point.

We now define Zhou bargaining set which is based on C. Let V be a TU game and let IJFSA.2018010104.m14 be a payoff vector. An objection at x is a pair IJFSA.2018010104.m15, where S is a non-empty coalition and y is a vector with indices in S satisfying IJFSA.2018010104.m16 and IJFSA.2018010104.m17 for each IJFSA.2018010104.m18. A Z-counterobjection to this objection is a pair IJFSA.2018010104.m19, where T is a coalition with IJFSA.2018010104.m20 satisfying that:

  • (A1) IJFSA.2018010104.m21, IJFSA.2018010104.m22, and IJFSA.2018010104.m23

  • (A2) IJFSA.2018010104.m24 for all IJFSA.2018010104.m25, and IJFSA.2018010104.m26 for all IJFSA.2018010104.m27

A payoff vector IJFSA.2018010104.m28 is said to belong to the Zhou bargaining set ZB(V) if for any objection at x, there exists a Z-counterobjection to it.

According to Zhou (1994), one good part by defining bargaining set on C is that it is free of any particular coalition structure. For the existence of Zhou bargaining sets, Zhou (1994) proved the following theorem.

Complete Article List

Search this Journal:
Reset
Open Access Articles: Forthcoming
Volume 9: 4 Issues (2020): 1 Released, 3 Forthcoming
Volume 8: 4 Issues (2019)
Volume 7: 4 Issues (2018)
Volume 6: 4 Issues (2017)
Volume 5: 4 Issues (2016)
Volume 4: 4 Issues (2015)
Volume 3: 4 Issues (2013)
Volume 2: 4 Issues (2012)
Volume 1: 4 Issues (2011)
View Complete Journal Contents Listing