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

DOI10.1137/110832021zbMath1258.68189OpenAlexW1990081825MaRDI QIDQ4899032

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

zbMATH Keywords

convex programsNash bargainingmarket equilibria

Mathematics Subject Classification ID

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

Related Items (5)

A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach ⋮ A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints ⋮ A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs ⋮ Exact solution approaches for integer linear generalized maximum multiplicative programs through the lens of multi-objective optimization ⋮ A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach

This page was built for publication: Rational Convex Programs and Efficient Algorithms for 2-Player Nash and Nonsymmetric Bargaining Games