The bilateral consistent prekernel for NTU games (Q1581908)
From MaRDI portal
 | This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use this page instead for the normal view: The bilateral consistent prekernel for NTU games |
scientific article; zbMATH DE number 1515524
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The bilateral consistent prekernel for NTU games |
scientific article; zbMATH DE number 1515524 |
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
0.9044601321220398
0 references
0.8160577416419983
0 references
0.8025051951408386
0 references
