On the other hand, highly exploitative greedy behaviors could guarantee minimum number of switches, while performance is only marginally downgraded.
This raw material was then leaked to the Daily Telegraph, which in May 2009 ran story after story about highly embarrassing, greedy, unjustifiable and sometimes criminal behaviour by politicians.
"Simply selling a monopoly airport from one greedy, highly indebted capitalist to another will benefit no one apart from the deal makers in the City," Mr. Harrison said, referring to London's financial district.
It is highly possible that greedy algorithms such as OMP can also be extended to be applied for such a purpose.
Therefore, highly exploitative ϵ-greedy strategy and its variants might not work in other cases.
Therefore, the highly exploitative ϵ-greedy strategy and its variants outperform the IntEstim strategy by switching less.
Therefore, in general time-critical social search tasks where rewards distribution and switching cost is usually unknown, we suggest adopting highly exploitative ϵ-greedy strategy and its variants.
Given that general time-critical social search problems usually have unknown reward distribution and switching cost, we suggest adopting highly exploitative ϵ-greedy strategy and its variants.
On the other hand, if all key information has similar number of appearances, highly exploitative ϵ-greedy strategy and its variants could be the most promising strategies.
Given that the highly exploitative ϵ-greedy strategy and its variants achieve overall promising performance in setting II and III, they should also be adopted in a more general social search problem with unknown rewards distribution.
