Rational Convex Programs and Efficient Algorithms for 2-Player Nash and Nonsymmetric Bargaining Games

Abstract

The solution to a Nash or a nonsymmetric bargaining game is obtained by maximizing a concave function over a convex set, i.e., it is the solution to a convex program. We show that each 2-player game whose convex program has linear constraints, admits a rational solution and such a solution can be found in polynomial time using only an LP solver. If in… (More)
DOI: 10.1137/110832021

Topics

1 Figure or Table

Cite this paper

@article{Vazirani2012RationalCP, title={Rational Convex Programs and Efficient Algorithms for 2-Player Nash and Nonsymmetric Bargaining Games}, author={Vijay V. Vazirani}, journal={SIAM J. Discrete Math.}, year={2012}, volume={26}, pages={896-918} }