DocumentCode :
3682150
Title :
Worst performance of Hedge in short games
Author :
Miltiades E. Anagnostou;Maria A. Lambrou
Author_Institution :
School of Electrical and Computer Engineering, National Technical University of Athens, 15780, Greece
fYear :
2015
Firstpage :
1
Lastpage :
6
Abstract :
Hedge has been proposed as an adaptive scheme, which guides an agent´s decision in resource selection and distribution problems in the areas of computer and communication networks, e.g. network path selection, load distribution, network interdiction, and also in problems in the area of transportation. Hedge dictates a decision based on the performance of a number of past similar decisions. Under certain conditions Hedge is known to provide an asymptotically optimal series of decisions. We perform an exact worst case analysis of the Hedge algorithm when it is used in instances with a small number of rounds.
Keywords :
"Games","Algorithm design and analysis","Ports (Computers)","Optimized production technology","Transportation","Delays","Force"
Publisher :
ieee
Conference_Titel :
EUROCON 2015 - International Conference on Computer as a Tool (EUROCON), IEEE
Type :
conf
DOI :
10.1109/EUROCON.2015.7313710
Filename :
7313710
Link To Document :
بازگشت