2 search results - page 1 / 1 » Rational Convex Programs, Their Feasibility, and the Arrow-D... |
CORR
2010
Springer
15 years 3 months ago
2010
Springer
159
click to vote
SAGT
2010
Springer
15 years 4 months ago
2010
Springer
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...