2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties

Details 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties

2009-08-09

arxiv.org/abs/0908.1181v3

Computer Science

Computer Science and Game Theory

Scientific paper

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 addition, the game is succinct, i.e., the coefficients in its convex program are ``small'', then its solution can be found in strongly polynomial time. We also give a non-succinct linear game whose solution can be found in strongly polynomial time.

Affiliated with

Also associated with

No associations

Rating

2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties 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 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and 2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-426175