301 | | The bidspace module contains functionality to support building a negotiation party. We currently have |
302 | | * OpponentModel: this is a category of classes that can estimate the opponent's profile from the bids that he places. |
303 | | * Pareto: this is a category of classes that can compute the pareto frontier from a set of profiles. Pareto optimality is an important mechanism to place optimal bids. |
304 | | * AllBidsList: this can be used to craete a list containing all possible bids in a domain. This list is created in a lazy way, and competely avoids storing the whole list in memory (which might not even fit) |
| 301 | The bidspace module contains functionality to support building a negotiation party. Especially for LinearAdditiveSpaces, a number of efficient tools are available that work orders of magnitude faster than brute force algorithms. |
| 302 | |
| 303 | ||OpponentModel|| this is a category of classes that can estimate the opponent's profile from the bids that he places.|| |
| 304 | ||Pareto||a category of classes that can compute the pareto frontier from a set of profiles. Pareto optimality is an important mechanism to place optimal bids. ParetoLinearAdditive can efficiently search LinearAdditiveUtilitySpace|| |
| 305 | ||AllBidsList: this can be used to craete a list containing all possible bids in a domain. This list is created in a lazy way, and competely avoids storing the whole list in memory (which might not even fit)|| |
| 306 | ||BidsWithUtility||A tool to efficiently search LinearAdditiveUtilitySpace for bids within a certain range.|| |