The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game

DOI10.1145/2160158.2160160zbMath1281.91095OpenAlexW2113766079MaRDI QIDQ5395679

Vijay V. Vazirani

Publication date: 17 February 2014

Published in: Journal of the ACM (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1145/2160158.2160160

Mathematics Subject Classification ID

Convex programming (90C25) Combinatorial optimization (90C27) Auctions, bargaining, bidding and selling, and other market models (91B26)

Related Items (9)

THE MAGIC OF NASH SOCIAL WELFARE IN OPTIMIZATION: DO NOT SUM, JUST MULTIPLY! ⋮ 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 ⋮ A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach ⋮ Portioning using ordinal preferences: fairness and efficiency ⋮ Speculative and hedging interaction model in oil and U.S. dollar markets -- phase transition ⋮ A note on balanced flows in equality networks ⋮ A Strongly Polynomial Algorithm for a Class of Minimum-Cost Flow Problems with Separable Convex Objectives

This page was built for publication: The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game