Nash bargaining theory when the number of alternatives can be finite
From MaRDI portal
Publication:2386282
DOI10.1007/S003550050114zbMATH Open1066.91557OpenAlexW1984586926MaRDI QIDQ2386282FDOQ2386282
Authors: Marco Mariotti
Publication date: 22 August 2005
Published in: Social Choice and Welfare (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s003550050114
Recommendations
Cited In (16)
- Price of fairness in two-agent single-machine scheduling problems
- Uncovered bargaining solutions
- Bargaining over a finite set of alternatives
- Compromising as an equal loss principle
- WPO, COV and IIA bargaining solutions for non-convex bargaining problems
- Bargaining through approval
- Negotiation strategies for agents with ordinal preferences: theoretical analysis and human study
- `Vintage' Nash bargaining without convexity
- Alternative characterizations of the proportional solution for nonconvex bargaining problems with claims
- A new two-party bargaining mechanism
- Some nonstandard features of bargaining problems
- Maximum latency scheduling problem on two-person cooperative games
- The ordinal egalitarian bargaining solution for finite choice sets
- An equitable Nash solution to nonconvex bargaining problems
- Rationality and solutions to nonconvex bargaining problems: rationalizability and Nash solutions
- Nash bargaining for log-convex problems
This page was built for publication: Nash bargaining theory when the number of alternatives can be finite
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2386282)