Rational convex programs and efficient algorithms for 2-player Nash and nonsymmetric bargaining games

DOI10.1137/110832021zbMATH Open1258.68189OpenAlexW1990081825MaRDI QIDQ4899032FDOQ4899032

Authors: Vijay V. Vazirani 

Publication date: 4 January 2013

Published in: SIAM Journal on Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/76f8a3f05a63cb00ce33fb8b1491a8e341604ddd

Recommendations

• 2-player Nash and nonsymmetric bargaining games: algorithms and structural properties
• The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game
• The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
• Nash Bargaining Via Flexible Budget Markets
• The Nash program: Non-convex bargaining problems

zbMATH Keywords

Nash bargainingconvex programsmarket equilibria

Mathematics Subject Classification ID

Convex programming (90C25) Analysis of algorithms (68W40) Auctions, bargaining, bidding and selling, and other market models (91B26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) 2-person games (91A05) Combinatorial games (91A46)

Cited In (10)

• A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs
• A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach
• 2-player Nash and nonsymmetric bargaining games: algorithms and structural properties
• A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach
• The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game
• Nash Bargaining Via Flexible Budget Markets
• A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints
• Rational generating functions and integer programming games
• The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game
• Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization

This page was built for publication: Rational convex programs and efficient algorithms for 2-player Nash and nonsymmetric bargaining games

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4899032)