Pages that link to "Item:Q2795862"
From MaRDI portal
The following pages link to Automated design of revenue-maximizing combinatorial auctions (Q2795862):
Displaying 13 items.
- Discovering theorems in game theory: two-person games with unique pure Nash equilibrium payoffs (Q420790) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- Leveraging possibilistic beliefs in unrestricted combinatorial auctions (Q725051) (← links)
- Reducing mechanism design to algorithm design via machine learning (Q959896) (← links)
- On the robustness of non-linear personalized price combinatorial auctions (Q976430) (← links)
- Automated design of revenue-maximizing combinatorial auctions (Q2795862) (← links)
- Robust Auctions for Revenue via Enhanced Competition (Q3387955) (← links)
- When Analysis Fails: Heuristic Mechanism Design via Self-correcting Procedures (Q3599064) (← links)
- Revenue Maximizing Markets for Zero-Day Exploits (Q4571149) (← links)
- Mechanism Design for Correlated Valuations: Efficient Methods for Revenue Maximization (Q5031029) (← links)
- A parametrization of the auction design space (Q5938628) (← links)
- Solving the winner determination problem in combinatorial auctions for fractional ownership of autonomous vehicles (Q6071125) (← links)
- Joint bidding in ad auctions (Q6636101) (← links)