Convergence analysis for symmetric arbitration games FOA and DOA (Q2767735)
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: Convergence analysis for symmetric arbitration games FOA and DOA |
scientific article; zbMATH DE number 1698472
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Convergence analysis for symmetric arbitration games FOA and DOA |
scientific article; zbMATH DE number 1698472 |
Statements
28 April 2003
0 references
Nash equilibrium theorem
0 references
arbitration game
0 references
final-offer arbitration
0 references
double-offer arbitration
0 references
Convergence analysis for symmetric arbitration games FOA and DOA (English)
0 references
The authors investigate Final-Offer Arbitration (FOA) and Double-Offer Arbitration (DOA) games. They consider the subclass of symmetric arbitration games which consists in the assumption that each player has the same symmetric probability distribution of the value of a fair settlement. The usual existence theorems for Nash equilibria cannot be applied here because continuity and convexity may not be assumed in these games. The main result in the article is the extension of the existence theorems for these types of games. Also solved is the problem of convergence of the offers in this context.
0 references