2000 character limit reached
Playing with and against Hedge (1812.03131v1)
Published 20 Nov 2018 in cs.LG, cs.MA, cs.NI, cs.PF, and stat.ML
Abstract: Hedge has been proposed as an adaptive scheme, which guides an agent's decision in resource selection and distribution problems that can be modeled as a multi-armed bandit full information game. Such problems are encountered 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. We study Hedge under the assumption that the total loss that can be suffered by the player in each round is upper bounded. In this paper, we study the worst performance of Hedge.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.