Changes between Version 242 and Version 243 of WikiStart
- Timestamp:
- 09/18/19 09:52:32 (5 years ago)
Legend:
- Unmodified
- Added
- Removed
- Modified
-
WikiStart
v242 v243 301 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 302 303 ||OpponentModel|| this is a category of classes that can estimate the opponent's profile from the bids that he places.|| 303 || ** Class ** || ** description ** || 304 ||OpponentModel||this is a category of classes that can estimate the opponent's profile from the bids that he places.|| 304 305 ||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 306 ||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)||