A note on the permutationally convex games (Q1174811): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(2 intermediate revisions by 2 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: The Relationship Between Convex Games and Minimum Cost Spanning Tree Games: A Case for Permutationally Convex Games / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Super-modularity: Applications to convex games and to the greedy algorithm for LP / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Cores of convex games / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Revision as of 10:26, 15 May 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | A note on the permutationally convex games |
scientific article |
Statements
A note on the permutationally convex games (English)
0 references
25 June 1992
0 references
An \(n\)-person side-payment game \(v\) is called permutationally convex with an ordering \(\pi\) on the player set, if \[ v(P^ \pi_ j\cup\{j\}\cup S)-v(P^ \pi_ j\cup\{j\})\leq v(P^ \pi_ k\cup\{k\}\cup S)-v(P^ \pi_ k\cup\{k\}) \] for all \(k\geq j\) and \(S\subset N\backslash[P^ \pi_ k\cup\{k\}]\), where \(P^ \pi_ j:=\{i\mid\pi(i)<\pi(j)\}\). It is well-known that a permutationally convex game with an ordering \(\pi\) has its marginal worth vector with respect to \(\pi\) as a member of the core. This paper shows by an example that the converse is false.
0 references
\(n\)-person side-payment game
0 references
permutationally convex game
0 references
marginal worth vector
0 references
core
0 references