Information Technology Reference
In-Depth Information
Problem with Beliefs
wrong about agent j 's preference order for the two bid. Each scenario
is repeated 1,000 times and the number of stable results achieved (out
of the 1,000 runs) is reported.
The results are shown in Figures 5.1 to 5.3, where we also imple-
ment a related approach [12] for comparison, which is a centralised
algorithm for non-transferable payoff problems. It can be seen from
Figures 5.1 to 5.3 that the result of our mechanism (labeled DNCF
(distributed non-transferable utility coalition formation mechanism))
is impressive, as it is able to reach a core-stable solution in over 97% of
all test cases, and b-core-stable solutions in almost 100% of the cases
in all composition of agent strategies. Whereas, for comparison, the
Fig. 5.1 Percentage of results in core.
Fig. 5.2 Percentage of results that are Pareto optimal.
Search WWH ::




Custom Search