Pages that link to "Item:Q4932630"
From MaRDI portal
The following pages link to An Efficient Winner Approximation for a Series of Combinatorial Auctions (Q4932630):
Displaying 10 items.
- Winner determination in geometrical combinatorial auctions (Q1698906) (← links)
- Time bounds for iterative auctions: a unified approach by discrete convex analysis (Q1751147) (← links)
- A speedy auction using approximated bidders' preferences (Q2173118) (← links)
- The cross-entropy method for the winner determination problem in combinatorial auctions (Q2209236) (← links)
- Approximation algorithms for a winner determination problem of single-item multi-unit auctions (Q2843172) (← links)
- A heuristic for winner determination in rule-based combinatorial auctions (Q2892265) (← links)
- CABOB: A Fast Optimal Algorithm for Winner Determination in Combinatorial Auctions (Q3115456) (← links)
- Approximation algorithms for combinatorial auctions with complement-free bidders (Q3581408) (← links)
- On the Economic Efficiency of the Combinatorial Clock Auction (Q4575680) (← links)
- (Q4980585) (← links)