Pages that link to "Item:Q5395679"
From MaRDI portal
The following pages link to The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game (Q5395679):
Displaying 10 items.
- Good programs in the RSS model without concavity of a utility function (Q874448) (← links)
- A branch-and-bound algorithm for a class of mixed integer linear maximum multiplicative programs: a bi-objective optimization approach (Q1628068) (← links)
- A linear programming based algorithm to solve a class of optimization problems with a multi-linear objective function and affine constraints (Q1652440) (← links)
- Speculative and hedging interaction model in oil and U.S. dollar markets -- phase transition (Q1706316) (← links)
- A note on balanced flows in equality networks (Q1730034) (← links)
- Portioning using ordinal preferences: fairness and efficiency (Q2680774) (← links)
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives (Q2817799) (← links)
- THE MAGIC OF NASH SOCIAL WELFARE IN OPTIMIZATION: DO NOT SUM, JUST MULTIPLY! (Q5038207) (← links)
- A Criterion Space Branch-and-Cut Algorithm for Mixed Integer Bilinear Maximum Multiplicative Programs (Q5087716) (← links)
- A criterion space search algorithm for mixed integer linear maximum multiplicative programs: a multiobjective optimization approach (Q6071088) (← links)
