Combining Information from Multiple Internet Sources

Example cont:
Then agents enter the next round with their URLs ranked as following:
Answer Agent 1 Agent 2 Agent 3
A
31 (subtracted
cost)
20 25
B 10 28,5 (subtracted
cost)
15
C 20 25 28 (subtracted
cost)
Agent 1 is assigned URL A as the highest ranked. Agent 2 is assigned URL B as
the highest ranked. Agent 3 is assigned URL C as the highest ranked.
Below the table with costs is presented. Costs are on its diagonal:
Agent 1 Agent 2 Agent 3
Agent 1 ((31-10)+(31-20))/10=3,2 35-10=25 35-20=15
Agent 2 30-20=10 ((28,5-20)+(28,5-25))/10=1,2 30-25=5
Agent 3 30-25=5 30-15=15 ((28-15)+(28-25))/10=1,6
As one can see in this round Agent 1 is considered as a loser. Its cost is
3,2 which is the highest one. Since it happened second time in a row - it and
result set assigned to it are removed from the further part of the
negotiation. The new ranks for answers are:
(Agent 1, A) = 31 – 3,2 = 27,8
(Agent 2, B) = 28,5 – 1,2 = 27,3
(Agent 3, C) = 28 – 1,6 = 26,4
Then process continues in this way until there is only one agent with his URL
assigned. Then, afterwards next “big” round is started.
Listing 3.2.2 Continuation of the example of Auction round flow process
In Auction method as in the Game theory method there is no direct participation of Search
Agents in the process. Search Agents are just for grouping purposes and could not be used at all.
30