Substitution with satiation: a new class of utility functions and a complementary pivot algorithm
From MaRDI portal
Publication:5219680
DOI10.1287/MOOR.2017.0892zbMATH Open1443.91154OpenAlexW2791150045MaRDI QIDQ5219680FDOQ5219680
Authors: Jugal Garg, Ruta Mehta, Vijay V. Vazirani 
Publication date: 12 March 2020
Published in: Mathematics of Operations Research (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/moor.2017.0892
Recommendations
- Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions
- Market equilibrium under piecewise Leontief concave utilities
- A complementary pivot algorithm for market equilibrium under separable, piecewise-linear concave utilities
- A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities
- Market equilibrium under piecewise Leontief concave utilities. (Extended abstract)
Analysis of algorithms and problem complexity (68Q25) Utility theory (91B16) Production theory, theory of the firm (91B38) Complementarity and equilibrium problems and variational inequalities (finite dimensions) (aspects of mathematical programming) (90C33)
Cites Work
- Network flows. Theory, algorithms, and applications.
- Title not available (Why is that?)
- Non-cooperative games
- Title not available (Why is that?)
- Title not available (Why is that?)
- Consensus of Subjective Probabilities: The Pari-Mutuel Method
- Market equilibrium via a primal-dual algorithm for a convex program
- The complexity of computing a Nash equilibrium
- Nonlinear Programming
- Bimatrix Equilibrium Points and Mathematical Programming
- Existence of an Equilibrium for a Competitive Economy
- On the Complexity of Nash Equilibria and Other Fixed Points
- Some Examples of Global Instability of the Competitive Equilibrium
- New complexity results about Nash equilibria
- On the complexity of the parity argument and other inefficient proofs of existence
- Equilibrium Points of Bimatrix Games
- The Approximation of Fixed Points of a Continuous Mapping
- Smoothed analysis of algorithms
- Settling the complexity of computing two-player Nash equilibria
- A convergent process of price adjustment and global Newton methods
- Rank-1 bimatrix games, a homeomorphism and a polynomial time algorithm
- Title not available (Why is that?)
- Convex separable optimization is not much harder than linear optimization
- Nash and correlated equilibria: Some complexity considerations
- Excess demand functions
- Leontief economies encode nonzero sum two-player games
- Hard-to-Solve Bimatrix Games
- The complexity of non-monotone markets
- Fixed points, Nash equilibria, and the existential theory of the reals
- A Polynomial Time Algorithm for Computing an Arrow–Debreu Market Equilibrium for Linear Utilities
- Handbook of computable general equilibrium modeling. Volume 1A and 1B
- Solving integer minimum cost flows with separable convex cost objective polynomially
- Computation of market equilibria by convex programming
- Orientation in Complementary Pivot Algorithms
- A finite algorithm for the linear exchange model
- Submodular flow problem with a nonseparable cost function
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- General equilibrium and the theory of directed graphs
- Market equilibrium under separable, piecewise-linear, concave utilities
- Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria
- Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities
- A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities
- Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria
- ETR-completeness for decision versions of multi-player (symmetric) Nash equilibria
- On computability of equilibria in markets with production
- Nonseparable, concave utilities are easy -- in a perfect price discrimination market model
- Dichotomies in equilibrium computation and membership of PLC markets in FIXP
Cited In (6)
- An improved algorithm for testing substitutability of weak preferences
- Computing equilibria for markets with constant returns production technologies
- Consensus Halving for Sets of Items
- Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions
- Consensus-Halving: Does It Ever Get Easier?
- A mechanism for participatory budgeting with funding constraints and project interactions
This page was built for publication: Substitution with satiation: a new class of utility functions and a complementary pivot algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5219680)
