Efficient computation of optimal auctions via reduced forms

Keyphrases

• Reduced Form 100%
• Efficient Computation 100%
• Allocation Rules 100%
• Multi-agent Problems 100%
• Optimal Auctions 100%
• New Characterization 50%
• Linear Constraints 50%
• Polynomial Time 50%
• Polynomial-time Algorithm 50%
• Multiple Items 50%
• Quadratic numbers 50%
• Matroid 50%
• Optimal Reduction 50%
• Greedy Mechanism 50%
• Multidimensional Preferences 50%
• Private Budgets 50%
• Agent Service 50%
• Polynomial-time Reduction 50%
• Quasi-linear Preferences 50%
• Token Passing 50%
• Ex-post Implementation 50%
• Feasibility Constraints 50%

Computer Science

• Polynomial Time 100%
• Efficient Computation 100%
• Polynomial Time Algorithm 50%
• Linear Constraint 50%
• multi-agent 50%
• Auction Problem 50%

Mathematics

• Polynomial Time 100%
• Reduced Form 100%
• Linear Constraint 33%
• Simple Form 33%
• Randomization 33%
• Matroid 33%