Nash bargaining with a nondeterministic threat
Computer Science and Game Theory
2008-01-04 v2
Abstract
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.
Keywords
Cite
@article{arxiv.0801.0092,
title = {Nash bargaining with a nondeterministic threat},
author = {Kerry Michael Soileau},
journal= {arXiv preprint arXiv:0801.0092},
year = {2008}
}
Comments
Added solution algorithm