Pages that link to "Item:Q3586382"
From MaRDI portal
The following pages link to Combinatorial Auctions with Verification Are Tractable (Q3586382):
Displaying 7 items.
- On revenue maximization with sharp multi-unit demands (Q266046) (← links)
- Truthful optimization using mechanisms with verification (Q391782) (← links)
- Optimal collusion-resistant mechanisms with verification (Q2016253) (← links)
- Combinatorial auctions with verification are tractable (Q2512655) (← links)
- A Qualitative Comparison of the Suitability of Four Theorem Provers for Basic Auction Theory (Q2843015) (← links)
- The Power of Verification for Greedy Mechanism Design (Q4580271) (← links)
- Computing Bayes-Nash Equilibria in Combinatorial Auctions with Verification (Q5130014) (← links)