Pages that link to "Item:Q814442"
From MaRDI portal
The following pages link to BOB: Improved winner determination in combinatorial auctions and generalizations (Q814442):
Displayed 15 items.
- A Lagrangian approach to the winner determination problem in iterative combinatorial reverse auctions (Q319409) (← links)
- An interactive approach for bi-attribute multi-item auctions (Q342785) (← links)
- Information-theoretic approaches to branching in search (Q429675) (← links)
- Comparing multiagent systems research in combinatorial auctions and voting (Q616771) (← links)
- Expressive markets for donating to charities (Q646531) (← links)
- The complexity of deciding reachability properties of distributed negotiation schemes (Q924139) (← links)
- An optimal multiprocessor combinatorial auction solver (Q947953) (← links)
- A model and heuristic algorithms for multi-unit nondiscriminatory combinatorial auction (Q947956) (← links)
- A new branch-and-bound algorithm for the maximum weighted clique problem (Q2002840) (← links)
- A hybrid ant colony algorithm for the winner determination problem (Q2130382) (← links)
- Combinatorial auctions (Q2480257) (← links)
- Combinatorial auctions with decreasing marginal utilities (Q2506310) (← links)
- Side constraints and non-price attributes in markets (Q2506312) (← links)
- Combinatorial auctions for electronic business (Q2571439) (← links)
- A REVIEW OF TREE CONVEX SETS TEST (Q4649838) (← links)