Optimal multi-unit combinatorial auctions
From MaRDI portal
Publication:2391528
DOI10.1007/S12351-011-0116-4zbMATH Open1268.91078OpenAlexW2019866359MaRDI QIDQ2391528FDOQ2391528
Authors: Sujit Gujar, Y. Narahari 
Publication date: 31 July 2013
Published in: Operational Research. An International Journal (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s12351-011-0116-4
Recommendations
optimal mechanismBayesian incentive compatibility (BIC)dominant strategy incentive compatibility (DSIC)individual rationality (IR)multi-unit combinatorial procurement auction
Cites Work
- Microeconomic theory
- Optimal Auction Design
- Dominant strategy implementation of Bayesian incentive compatible allocation rules
- Optimal procurement mechanisms for divisible goods with capacitated suppliers
- Optimal Multi-Object Auctions
- Multidimensional mechanism design: revenue maximization and the multiple-good monopoly
- Combinatorial auctions for electronic business
- Multiple unit auctions of an indivisible good
- Iterative Dutch combinatorial auctions
- Optimal auctions for multi-unit procurement with volume discount bids
Cited In (20)
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach
- Optimal auctions for multi-unit procurement with volume discount bids
- Title not available (Why is that?)
- Optimal bidding in a uniform price auction with multi-unit demand
- Computational Science – ICCS 2005
- An optimal bidimensional multi-armed bandit auction for multi-unit procurement
- Optimal pricing in iterative flexible combinatorial procurement auctions
- Optimal design of scoring auctions with multidimensional quality
- Worst-case optimal redistribution of VCG payments in multi-unit auctions
- Optimal Multi-Object Auctions
- Energy Prosumers : Profiling the Energy Microgeneration Market In Lower Silesia, Poland
- Multiple unit auctions with strategic price-quantity decisions
- A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction
- Optimal Mechanisms for Combinatorial Auctions and Combinatorial Public Projects via Convex Rounding
- Multiple unit auctions with economies and diseconomies of scale
- An asymmetric multi-item auction with quantity discounts applied to Internet service procurement in Buenos Aires public schools
- Compact bidding languages and supplier selection for markets with economies of scale and scope
- Bundling equilibrium in combinatorial auctions
- Allocative efficiency in simulated multiple-unit combinatorial auctions with quantity support
- Computing and Combinatorics
This page was built for publication: Optimal multi-unit combinatorial auctions
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2391528)
