On complexity of single-minded auction
From MaRDI portal
Recommendations
Cites work
- Algorithmic Aspects of the Core of Combinatorial Optimization Games
- Combinatorial auctions with decreasing marginal utilities
- Combinatorial auctions: a survey
- Communication Complexity
- Competitive equilibrium in an exchange economy with indivisibilities
- Computational Complexity of the Game Theory Approach to Cost Allocation for a Tree
- Differential-revelation VCG mechanisms for combinatorial auctions
- Existence of an Equilibrium for a Competitive Economy
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 2079341 (Why is no real title available?)
- scientific article; zbMATH DE number 1445290 (Why is no real title available?)
- Job Matching, Coalition Formation, and Gross Substitutes
- Microeconomic theory
- On rational computability and communication complexity
- On the Complexity of Cooperative Solution Concepts
- On the complexity of equilibria
- The assignment game. I: The core
- Truth revelation in approximately efficient combinatorial auctions
- Walrasian equilibrium with gross substitutes
Cited in
(6)- Hyper-T-width and hyper-D-width: Stable connectivity measures for hypergraphs
- On social envy-freeness in multi-unit markets
- Approximation of Walrasian equilibrium in single-minded auctions
- Coordinating monetary contributions in participatory budgeting
- Decentralized subcontractor scheduling with divisible jobs
- Walrasian equilibrium: Hardness, approximations and tractable instances
This page was built for publication: On complexity of single-minded auction
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1765304)