The bilateral consistent prekernel for NTU games (Q1581908): Difference between revisions
From MaRDI portal
Set profile property. |
Set OpenAlex properties. |
||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1006/game.2000.0757 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W2047033344 / rank | |||
Normal rank |
Revision as of 23:44, 19 March 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | The bilateral consistent prekernel for NTU games |
scientific article |
Statements
The bilateral consistent prekernel for NTU games (English)
0 references
10 October 2000
0 references
The authors propose bilateral consistent prekernel for NTU games, which coincides with the prekernel for TU games and with the Nash set for pure bargaining games. An axiomatization is given on a specific class of games.
0 references
Nash bargaining solution
0 references
bilateral consistent prekernel
0 references
NTU games
0 references