Negotiating over Bundles and Prices Using Aggregate Knowledge
Combining two or more items and selling them as one good, a practice called bundling, can be a very effective
arxiv.orgrank this link
Refine results · kind
shop)
3 indexed results
Iterative Deepening Branch and Bound
In tree search problem the best-first search algorithm needs too much of space . To remove such drawbacks of these
arxiv.orgrank this link
Online Learning of Aggregate Knowledge about Non-linear Preferences Applied to Negotiating Prices and Bundles
In this paper, we consider a form of multi-issue negotiation where a shop negotiates both the contents and the price
arxiv.orgrank this link