Lexicographic monotone path solutions (Q1122515): Difference between revisions
From MaRDI portal
ReferenceBot (talk | contribs) Changed an Item |
Set OpenAlex properties. |
||
| Property / full work available at URL | |||
| Property / full work available at URL: https://doi.org/10.1007/bf01721166 / rank | |||
Normal rank | |||
| Property / OpenAlex ID | |||
| Property / OpenAlex ID: W2105069120 / rank | |||
Normal rank | |||
Latest revision as of 10:45, 30 July 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Lexicographic monotone path solutions |
scientific article |
Statements
Lexicographic monotone path solutions (English)
0 references
1989
0 references
The main theorem is that a solution in a two-person bargaining problem satisfies individual rationality, Pareto optimality, Pareto continuity and restricted monotonicity with respect to additions, if and only if it is a lexicographic monotone path solution.
0 references
two-person bargaining
0 references
individual rationality
0 references
Pareto optimality
0 references
Pareto continuity
0 references
lexicographic monotone path solution
0 references
