Nash bargaining with a nondeterministic threat

Computer Science – Computer Science and Game Theory

Scientific paper

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

Added solution algorithm

Scientific paper

We consider bargaining problems which involve two participants, with a nonempty closed, bounded convex bargaining set of points in the real plane representing all realizable bargains. We also assume that there is no definite threat or disagreement point which will provide the default bargain if the players cannot agree on some point in the bargaining set. However, there is a nondeterministic threat: if the players fail to agree on a bargain, one of them will be chosen at random with equal probability, and that chosen player will select any realizable bargain as the solution, subject to a reasonable restriction.

No associations

LandOfFree

Say what you really think

Search LandOfFree.com for scientists and scientific papers. Rate them and share your experience with other people.

Rating

Nash bargaining with a nondeterministic threat does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Nash bargaining with a nondeterministic threat, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Nash bargaining with a nondeterministic threat will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFWR-SCP-O-713864

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.