Pages that link to "Item:Q319409"
From MaRDI portal
The following pages link to A Lagrangian approach to the winner determination problem in iterative combinatorial reverse auctions (Q319409):
Displaying 12 items.
- Optimal bidding in auctions from a game theory perspective (Q320681) (← links)
- Towards fast Vickrey pricing using constraint programming (Q703125) (← links)
- An optimal multiprocessor combinatorial auction solver (Q947953) (← links)
- Winner determination in geometrical combinatorial auctions (Q1698906) (← links)
- Optimal pricing in iterative flexible combinatorial procurement auctions (Q1740561) (← links)
- Truthfulness with value-maximizing bidders: on the limits of approximation in combinatorial markets (Q1753496) (← links)
- On heuristics for solving winner determination problem in combinatorial auctions (Q1771208) (← links)
- The cross-entropy method for the winner determination problem in combinatorial auctions (Q2209236) (← links)
- A formulation of combinatorial auction via reverse convex programming (Q2498233) (← links)
- An Efficient Winner Approximation for a Series of Combinatorial Auctions (Q4932630) (← links)
- (Q4980585) (← links)
- Winner determination with sustainable-flexible considerations under demand uncertainty in transportation service procurement auctions (Q6146888) (← links)