Implementation of Reduced Form Auctions: A Geometric Approach
From MaRDI portal
(Redirected from Publication:3974418)
Recommendations
- On the Implementability of Reduced Form Auctions
- An Extension to the Implementability of Reduced Form Auctions
- Reduced form auctions revisited
- Efficient computation of optimal auctions via reduced forms
- Asymmetric reduced form auctions
- Generalized reduced-form auctions: a network-flow approach
- A formulation of combinatorial auction via reverse convex programming
- On vector formulations of auction-type problems with applications
- Winner determination in geometrical combinatorial auctions
- The polyhedral geometry of truthful auctions
Cited in
(32)- Approximate revenue maximization with multiple items
- Welfare-preserving \(\varepsilon \)-BIC to BIC transformation with negligible revenue loss
- Reduced-form budget allocation with multiple public alternatives
- Mechanism design with costly verification and limited punishments
- A note on optimal allocation with costly verification
- Reserve price efficiency and competitive pressure in auctions
- Mechanism design with budget constraints and a population of agents
- Efficient mechanisms with information acquisition
- Dominant-strategy and Bayesian incentive compatibility in multi-object trading environments
- Optimal auctions with financially constrained buyers
- Reduced form implementation for environments with value interdependencies
- On the Implementability of Reduced Form Auctions
- An Extension to the Implementability of Reduced Form Auctions
- Alea iacta est: auctions, persuasion, interim rules, and dice
- Efficient computation of optimal auctions via reduced forms
- A demand partitioning framework to reserve production for small enterprises
- Asymmetric reduced form auctions
- Who wants to be an auctioneer?
- Symmetric reduced-form voting
- Selling to multiple no-regret buyers
- Cardinal Bayesian allocation mechanisms without transfers
- Quota implementation in assignment games
- Allocation without transfers: a welfare-maximizing mechanism under incomplete information
- Intertemporal allocation with unknown discounting
- Decomposing probability marginals beyond affine requirements
- Optimization and mechanism design
- Random allocations of multiple objects with incomplete information
- An algorithmic framework for black-box reductions from Bayesian mechanism design to algorithm design
- Persuasion and incentives through the lens of duality
- Efficient compromising
- Reduced form auctions revisited
- Optimal dynamic mechanism design with deadlines
This page was built for publication: Implementation of Reduced Form Auctions: A Geometric Approach
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3974418)
