scientific article; zbMATH DE number 7204414
From MaRDI portal
Publication:5111298
Recommendations
Cites work
- Algorithmic Game Theory
- Combinatorial auctions via posted prices
- Efficiency Guarantees in Auctions with Budgets
- Envy-free revenue approximation for asymmetric buyers with budgets
- How Profitable Are Strategic Behaviors in a Market?
- Job Matching, Coalition Formation, and Gross Substitutes
- Mechanisms for multi-unit auctions
- Multi-unit auctions with budget limits
- Multi-unit auctions: beyond Roberts
- On profit-maximizing envy-free pricing
- Optimal Auction Design
- Reducing Revenue to Welfare Maximization: Approximation Algorithms and other Generalizations
- Revenue maximizing envy-free fixed-price auctions with budgets
- Selling multiple correlated goods: revenue maximization and menu-size complexity
- To save or not to save: the Fisher game
- Verifiably truthful mechanisms
- Walrasian equilibrium with gross substitutes
Cited in
(13)- Multiple unit auctions with strategic price-quantity decisions
- Multidimensional bargaining and posted prices
- Walrasian pricing in multi-unit auctions
- On fair price discrimination in multi-unit markets
- Simple combinatorial auctions with budget constraints
- The case for multi-unit single-run descending-price auctions
- Computing a Walrasian Equilibrium in Iterative Auctions with Multiple Differentiated Items
- On envy-free revenue approximation for combinatorial buyers with budgets
- Pricing model in the Walras economic equilibrium scheme
- On social envy-freeness in multi-unit markets
- Mechanisms and impossibilities for truthful, envy-free allocations
- A multi-item auction with budget-constrained bidders and price controls
- Pricing multi-unit markets
This page was built for publication:
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5111298)
