scientific article; zbMATH DE number 7053330

Publication date: 10 May 2019

Full work available at URL: https://dl.acm.org/citation.cfm?id=2095194

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

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

Related Items (1)

The Minimum Principle of SINR: A Useful Discretization Tool for Wireless Communication

Cites Work

Unnamed Item
Unnamed Item
Unnamed Item
Unnamed Item
A polynomial algorithm for minimum quadratic cost flow problems
Geometric algorithms and combinatorial optimization
A finite algorithm for the linear exchange model
Nonsymmetric Nash solutions and replications of 2-person bargaining
An \(\varepsilon\)-relaxation method for separable convex cost generalized network flow problems
A combinatorial algorithm minimizing submodular functions in strongly polynomial time.
Multivariate Gaussians, semidefinite matrix completion, and convex algebraic geometry
Improved algorithms for computing fisher's market clearing prices
A Perfect Price Discrimination Market Model with Production, and a Rational Convex Program for It
Rationality and Strongly Polynomial Solvability of Eisenberg–Gale Markets with Two Agents
Market equilibrium under separable, piecewise-linear, concave utilities
The Bargaining Problem
2-Player Nash and Nonsymmetric Bargaining Games: Algorithms and Structural Properties
Spending Constraint Utilities with Applications to the Adwords Market
Consensus of Subjective Probabilities: The Pari-Mutuel Method
Market equilibrium via a primal--dual algorithm for a convex program
Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria
A polynomially bounded algorithm for a singly constrained quadratic program
Polynomial Methods for Separable Convex Optimization in Unimodular Linear Spaces with Applications
Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities
Paths, Trees, and Flowers
A Polynomial Time Algorithm for Computing an Arrow–Debreu Market Equilibrium for Linear Utilities
On Polyhedral Approximations of the Second-Order Cone
Convex separable optimization is not much harder than linear optimization

This page was built for publication: