Walrasian equilibria from an optimization perspective: A guide to the literature
From MaRDI portal
Publication:6076488
DOI10.1002/nav.21963zbMath1527.91107OpenAlexW3108203194MaRDI QIDQ6076488
Unnamed Author, Martin Bichler, Maximilian Fichtl
Publication date: 17 October 2023
Published in: Naval Research Logistics (NRL) (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1002/nav.21963
Auctions, bargaining, bidding and selling, and other market models (91B26) General equilibrium theory (91B50) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)
Related Items (max. 100)
Strong substitutes: structural properties, and a new algorithm for competitive equilibrium prices ⋮ Competitive equilibrium always exists for combinatorial auctions with graphical pricing schemes ⋮ Core Pricing in Combinatorial Exchanges with Financially Constrained Buyers: Computational Hardness and Algorithmic Solutions ⋮ Computing Large Market Equilibria Using Abstractions
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Lectures on convex optimization
- Stability by Liapunov's direct method. With applications
- Bilevel programming: a survey
- On ascending Vickrey auctions for heterogeneous objects
- Modeling and analysis of an auction-based logistics market
- A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction
- Substitute goods, auctions, and equilibrium
- Block order restrictions in combinatorial electric energy auctions
- Computation of a large-scale competitive equilibrium through optimization
- The ellipsoid method and its consequences in combinatorial optimization
- Walrasian equilibrium with gross substitutes
- The auction algorithm: A distributed relaxation method for the assignment problem
- Competitive equilibrium in an exchange economy with indivisibilities
- New characterizations of M-convex functions and their applications to economic equilibrium models with indivisibilities.
- An efficient ascending auction for private valuations
- A preference-based, multi-unit auction for pricing and capacity allocation
- Gross substitutability: an algorithmic survey
- Time bounds for iterative auctions: a unified approach by discrete convex analysis
- Truthfulness with value-maximizing bidders: on the limits of approximation in combinatorial markets
- Project scheduling under uncertainty: survey and research potentials
- A principal-agent model of bidding firms in multi-unit auctions
- The package assignment model.
- Optimal capacity allocation in multi-auction electricity markets under uncertainty
- Gross substitutes and complements: a simple generalization
- Operations research and data mining
- The assignment game. I: The core
- Computationally efficient MIP formulation and algorithms for European day-ahead electricity market auctions
- EQUILIBRIUM, AUCTION, AND GENERALIZED GROSS SUBSTITUTES AND COMPLEMENTS
- Handbook of Spectrum Auction Design
- On the Existence of General Equilibrium for a Competitive Market
- Equilibria and Indivisibilities: Gross Substitutes and Complements
- Integer programming duality: Price functions and sensitivity analysis
- Job Matching, Coalition Formation, and Gross Substitutes
- On the core and competitive equilibria of a market with indivisible goods
- Discrete Convex Analysis
- Strategy-proofness in the Large
- Auction design without quasilinear preferences
- Subquadratic submodular function minimization
- Understanding Preferences: “Demand Types”, and the Existence of Equilibrium With Indivisibilities
- GROSS SUBSTITUTES CONDITION AND DISCRETE CONCAVITY FOR MULTI-UNIT VALUATIONS: A SURVEY
- Quasi-Equilibria in Markets with Non-Convex Preferences
- A Note on Kelso and Crawford's Gross Substitutes Condition
- Existence of an Equilibrium for a Competitive Economy
- Discrete convexity and equilibria in economies with indivisible goods and money
This page was built for publication: Walrasian equilibria from an optimization perspective: A guide to the literature
