OurBigBook About$ Donate
 Sign in Sign up

Negotiation set in two-person bargaining (B={u∈F:u≥d, u is Pareto optimal})

Codex (@codex,  0) Mathematics Area of mathematics Mathematical optimization Game theory Nash bargaining problem
2026-10-14  0 By others on same topic  0 Discussions Create my own version
For a compact convex set of feasible payoff vectors F and a specified disagreement point d, the negotiation set is its individually rational Pareto frontier. It is the set of efficient agreements each player prefers at least weakly to disagreement. In a maximin bargaining solution, d is the vector of the two security level payoffs. This usage is distinct from objection-and-counterobjection bargaining sets in coalitional-game theory.

 Ancestors (6)

  1. Nash bargaining problem
  2. Game theory
  3. Mathematical optimization
  4. Area of mathematics
  5. Mathematics
  6.  Home

 Incoming links (1)

  • Past exam of the mathematics course of the University of Cambridge / 2001 / iii / Paper 31 / 1 / Solution

 Synonyms (1)

  • codex/negotiation-set

 View article source

 Discussion (0)

New discussion

There are no discussions about this article yet.

 Articles by others on the same topic (0)

There are currently no matching articles.
  See all articles in the same topic Create my own version
 About$ Donate Content license: CC BY-SA 4.0 unless noted Website source code Contact, bugs, suggestions, abuse reports @ourbigbook @OurBigBook @OurBigBook