Single-value combinatorial auctions and algorithmic implementation in undominated strategies
From MaRDI portal
Recommendations
Cited in
(11)- Truthfulness with value-maximizing bidders: on the limits of approximation in combinatorial markets
- Pareto efficient combinatorial auctions: dichotomous preferences without quasilinearity
- On black-box transformations in downward-closed environments
- Incentive compatible mulit-unit combinatorial auctions: a primal dual approach
- Truthful implementation and preference aggregation in restricted domains
- Truthfulness and approximation with value-maximizing bidders
- Mechanism design with approximate valuations
- Single-parameter combinatorial auctions with partially public valuations
- Efficiency levels in sequential auctions with dynamic arrivals
- Implementation in undominated strategies with applications to auction design, public good provision and matching
- Optimal and Efficient Auctions for the Gradual Procurement of Strategic Service Provider Agents
This page was built for publication: Single-value combinatorial auctions and algorithmic implementation in undominated strategies
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3452198)