Values and potential of games with cooperation structure (Q1972566): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(4 intermediate revisions by 3 users not shown) | |||
Property / author | |||
Property / author: Jésus Mario Bilbao / rank | |||
Property / reviewed by | |||
Property / reviewed by: Q588474 / rank | |||
Property / author | |||
Property / author: Jésus Mario Bilbao / rank | |||
Normal rank | |||
Property / reviewed by | |||
Property / reviewed by: O. M. Kosheleva / rank | |||
Normal rank | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the Position Value for Communication Situations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Sequencing games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Mathematical Properties of the Banzhaf Power Index / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The theory of convex geometries / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A note on voting / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: A Simplified Bargaining Model for the n-Person Cooperative Game / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3491348 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Graphs and Cooperation in Games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Conference structures and fair allocation rules / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3999542 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: On the convexity of communication games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Allocation rules for hypergraph communication situations / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Values of Graph-Restricted Games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: \(\Gamma\)-component additive games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q3748279 / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 15:21, 29 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Values and potential of games with cooperation structure |
scientific article |
Statements
Values and potential of games with cooperation structure (English)
0 references
11 April 2000
0 references
For traditional cooperative games in which all coalitions are possible, there exist several natural ways of dividing the total payoff \(v(N)\), e.g., the Shapley value in which \(i\)-th player gets an average of what he brings to all possible coalitions: \(\Phi_i(N,v)=\sum_{S:i\in S\subseteq N} (s-1)!\cdot (n-s)!\cdot [v(S)-v(S-\{i\})]/n!\), where \(s\) is the number of players in \(S\), and \(n\) is the total number of players. In some real-life situations, not all coalitions are possible. The class of all possible coalitions is called a cooperative structure. The author generalizes the known values (including the Shapley value) to games with cooperative structure, shows how known algorithms for computing these values can be generalized to such games, and which properties of the values are preserved under this generalization. The proofs are based on convex geometry, a discrete analogue of convex sets.
0 references
cooperative games
0 references
Shapley value
0 references
cooperative structure
0 references