Pages that link to "Item:Q2386282"
From MaRDI portal
The following pages link to Nash bargaining theory when the number of alternatives can be finite (Q2386282):
Displaying 16 items.
- Maximum latency scheduling problem on two-person cooperative games (Q358650) (← links)
- Uncovered bargaining solutions (Q532700) (← links)
- Bargaining over a finite set of alternatives (Q535400) (← links)
- The ordinal egalitarian bargaining solution for finite choice sets (Q656807) (← links)
- Bargaining through approval (Q745006) (← links)
- Alternative characterizations of the proportional solution for nonconvex bargaining problems with claims (Q988673) (← links)
- `Vintage' Nash bargaining without convexity (Q1668155) (← links)
- Price of fairness in two-agent single-machine scheduling problems (Q1728475) (← links)
- WPO, COV and IIA bargaining solutions for non-convex bargaining problems (Q1938829) (← links)
- A new two-party bargaining mechanism (Q1945697) (← links)
- An equitable Nash solution to nonconvex bargaining problems (Q2329412) (← links)
- Nash bargaining for log-convex problems (Q2343476) (← links)
- Rationality and solutions to nonconvex bargaining problems: rationalizability and Nash solutions (Q2637412) (← links)
- SOME NONSTANDARD FEATURES OF BARGAINING PROBLEMS (Q2854006) (← links)
- Compromising as an equal loss principle (Q6172228) (← links)
- Negotiation strategies for agents with ordinal preferences: theoretical analysis and human study (Q6193096) (← links)
