Substitution with satiation: a new class of utility functions and a complementary pivot algorithm
From MaRDI portal
Publication:5219680
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)
Cites work
- scientific article; zbMATH DE number 53115 (Why is no real title available?)
- scientific article; zbMATH DE number 3466805 (Why is no real title available?)
- scientific article; zbMATH DE number 3571895 (Why is no real title available?)
- scientific article; zbMATH DE number 3069632 (Why is no real title available?)
- A Polynomial Time Algorithm for Computing an Arrow–Debreu Market Equilibrium for Linear Utilities
- A complementary pivot algorithm for markets under separable, piecewise-linear concave utilities
- A convergent process of price adjustment and global Newton methods
- A finite algorithm for the linear exchange model
- Bimatrix Equilibrium Points and Mathematical Programming
- Computation of market equilibria by convex programming
- Consensus of Subjective Probabilities: The Pari-Mutuel Method
- Convex separable optimization is not much harder than linear optimization
- Dichotomies in equilibrium computation and membership of PLC markets in FIXP
- ETR-completeness for decision versions of multi-player (symmetric) Nash equilibria
- Equilibrium Points of Bimatrix Games
- Excess demand functions
- Existence of an Equilibrium for a Competitive Economy
- FSTTCS 2005: Foundations of Software Technology and Theoretical Computer Science
- Fixed points, Nash equilibria, and the existential theory of the reals
- General equilibrium and the theory of directed graphs
- Handbook of computable general equilibrium modeling. Volume 1A and 1B
- Hard-to-Solve Bimatrix Games
- Leontief economies encode nonzero sum two-player games
- Market equilibrium under separable, piecewise-linear, concave utilities
- Market equilibrium via a primal-dual algorithm for a convex program
- Nash and correlated equilibria: Some complexity considerations
- Network flows. Theory, algorithms, and applications.
- New complexity results about Nash equilibria
- Non-cooperative games
- Nonlinear Programming
- Nonseparable, concave utilities are easy -- in a perfect price discrimination market model
- On computability of equilibria in markets with production
- On the Complexity of Nash Equilibria and Other Fixed Points
- On the complexity of the parity argument and other inefficient proofs of existence
- Orientation in Complementary Pivot Algorithms
- Rank-1 bimatrix games, a homeomorphism and a polynomial time algorithm
- Settling the Complexity of Arrow-Debreu Equilibria in Markets with Additively Separable Utilities
- Settling the complexity of Leontief and PLC exchange markets under exact and approximate equilibria
- Settling the complexity of computing two-player Nash equilibria
- Smoothed analysis of algorithms
- Solving integer minimum cost flows with separable convex cost objective polynomially
- Some Examples of Global Instability of the Competitive Equilibrium
- Spending Is Not Easier Than Trading: On the Computational Equivalence of Fisher and Arrow-Debreu Equilibria
- Submodular flow problem with a nonseparable cost function
- The Approximation of Fixed Points of a Continuous Mapping
- The complexity of computing a Nash equilibrium
- The complexity of non-monotone markets
Cited in
(6)- Consensus Halving for Sets of Items
- A mechanism for participatory budgeting with funding constraints and project interactions
- Dichotomies in equilibrium computation, and complementary pivot algorithms for a new class of non-separable utility functions
- Computing equilibria for markets with constant returns production technologies
- Consensus-Halving: Does It Ever Get Easier?
- An improved algorithm for testing substitutability of weak preferences
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)
