Last change
on this file since 734 was 519, checked in by wouter, 18 months ago |
#169 added geniusweb sources hard copy in the project as I need to hack it a bit.
|
File size:
1.0 KB
|
Line | |
---|
1 | package geniusweb.profile;
|
---|
2 |
|
---|
3 | import geniusweb.issuevalue.Bid;
|
---|
4 |
|
---|
5 | /**
|
---|
6 | * Defines a is-better relation between bids. This basically is a partially
|
---|
7 | * ordered space however some bids or groups of bids may not be relatable to
|
---|
8 | * others.
|
---|
9 | */
|
---|
10 | public interface PartialOrdering extends Profile {
|
---|
11 |
|
---|
12 | /**
|
---|
13 | * @param bid1 the first item's utility/preference
|
---|
14 | * @param bid2 the second item's utility/preference
|
---|
15 | * @return true iff bid1 is considered better or equal (≥) than bid 2. In
|
---|
16 | * all other cases false is returned. A bid may not have a ≥
|
---|
17 | * relation at all.
|
---|
18 | *
|
---|
19 | * This predicate should be implemented such that
|
---|
20 | * <ul>
|
---|
21 | * <li>b ≥ b (every bid is better or equal to itself)
|
---|
22 | * <li>If b1≥b2 and b2≥b1 then the two bids are considered
|
---|
23 | * equally good. Note that this differes from a partial order in
|
---|
24 | * mathematics.
|
---|
25 | * <li>it behaves transitive: if b1≥b2 and b2≥b3 then
|
---|
26 | * b1≥b3.
|
---|
27 | * </ul>
|
---|
28 | */
|
---|
29 | boolean isPreferredOrEqual(Bid bid1, Bid bid2);
|
---|
30 | }
|
---|
Note:
See
TracBrowser
for help on using the repository browser.