Pages that link to "Item:Q2843172"
From MaRDI portal
The following pages link to Approximation algorithms for a winner determination problem of single-item multi-unit auctions (Q2843172):
Displaying 8 items.
- Time bounds for iterative auctions: a unified approach by discrete convex analysis (Q1751147) (← links)
- On the fastest Vickrey algorithm (Q1957643) (← links)
- A multiple-choice secretary algorithm with applications to online auctions (Q2921721) (← links)
- CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions (Q3115456) (← links)
- Approximation Algorithms for k-Duplicates Combinatorial Auctions with Subadditive Bidders (Q3611968) (← links)
- Energy Prosumers : Profiling the Energy Microgeneration Market In Lower Silesia, Poland (Q4553406) (← links)
- An Efficient Winner Approximation for a Series of Combinatorial Auctions (Q4932630) (← links)
- Computing and Combinatorics (Q5716982) (← links)