Market equilibrium via a primal-dual algorithm for a convex program
From MaRDI portal
(Redirected from Publication:3452188)
Recommendations
- A Polynomial Time Algorithm for Computing an Arrow–Debreu Market Equilibrium for Linear Utilities
- Combinatorial algorithms for market equilibria
- A simple and efficient algorithm for computing market equilibria
- Computation of market equilibria by convex programming
- Auction Algorithms for Market Equilibrium
Cited in
(61)- Ratio-balanced maximum flows
- How to allocate goods in an online market?
- Polyhedral complementarity on a simplex. Potentiality of regular mappings
- Approximating the Nash Social Welfare with Indivisible Items
- A new conjugate gradient hard thresholding pursuit algorithm for sparse signal recovery
- On competitiveness in uniform utility allocation markets
- A perfect price discrimination market model with production, and a (rational) convex program for it
- A note on balanced flows in equality networks
- Rapidly Solving an Online Sequence of Maximum Flow Problems with Extensions to Computing Robust Minimum Cuts
- Combinatorial algorithms for general linear Arrow-Debreu markets
- How to allocate goods in an online market?
- 2-player Nash and nonsymmetric bargaining games: algorithms and structural properties
- Improved balanced flow computation using parametric flow
- A smooth path-following algorithm for market equilibrium under a class of piecewise-smooth concave utilities
- Parametric algorithm for a linear exchange model with spending constraints
- Distributed price adjustment based on convex analysis
- Substitution with satiation: a new class of utility functions and a complementary pivot algorithm
- Algorithmic principle of least revenue for finding market equilibria
- On the implementation of combinatorial algorithms for the linear exchange market
- A complementary pivot algorithm for market equilibrium under separable, piecewise-linear concave utilities
- Rationality and strongly polynomial solvability of Eisenberg-Gale markets with two agents
- Computational complexity of the Hylland-Zeckhauser mechanism for one-sided matching markets
- Fair resource allocation in a volatile marketplace
- On Equilibrium Pricing as Convex Optimization
- Combinatorial algorithms for market equilibria
- Nash equilibria in Fisher market
- Fisher markets with linear constraints: equilibrium properties and efficient distributed algorithms
- Computation of market equilibria by convex programming
- Computational complexity of the Hylland-Zeckhauser scheme for one-sided matching markets
- Auction algorithms for market equilibrium with weak Gross substitute demands and their applications
- A primal-dual algorithm for computing Fisher equilibrium in the absence of gross substitutability property
- Amortized Analysis of Asynchronous Price Dynamics
- A Truthful Mechanism for Offline Ad Slot Scheduling
- A consumer-theoretic characterization of Fisher market equilibria
- Eisenberg-Gale markets: algorithms and game-theoretic properties
- Fair Division of Indivisible Goods for a Class of Concave Valuations
- Towards polynomial simplex-like algorithms for market equilibria
- A perfect price discrimination market model with production, and a rational convex program for it
- Polyhedral complementarity on a simplex: search for fixed points of decreasing regular mappings
- Ascending-price algorithms for unknown markets
- The notion of a rational convex program, and an algorithm for the Arrow-Debreu Nash bargaining game
- When dividing mixed manna is easier than dividing goods: competitive equilibria with a constant number of chores
- Incentive ratio: a game theoretical analysis of market equilibria
- Computation of Fisher-Gale equilibrium by auction
- Connection of two approaches to the Fisher model
- Computing Market Equilibria with Price Regulations Using Mathematical Programming
- A simplex-like algorithm for Fisher markets
- Envy-freeness and maximum Nash welfare for mixed divisible and indivisible goods
- Monotonicity and competitive equilibrium in cake-cutting
- An alternating algorithm for finding linear Arrow-Debreu market equilibria
- A primal-dual algorithm for the computation of market equilibrium with logarithmic utility functions
- Exchange market equilibria with Leontief's utility: freedom of pricing leads to rationality
- Markets for efficient public good allocation with social distancing
- Market exchange models and geometric programming
- Tight incentive analysis of Sybil attacks against the market equilibrium of resource exchange over general networks
- Proportional response dynamics in the Fisher market
- A strongly polynomial algorithm for a class of minimum-cost flow problems with separable convex objectives
- Improved algorithms for computing Fisher's market clearing prices
- Tatonnement beyond gross substitutes? Gradient descent to the rescue
- Interior point algorithm for the competitive market equilibrium problems
- Optimization and operations research in mitigation of a pandemic
This page was built for publication: Market equilibrium via a primal-dual algorithm for a convex program
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452188)
