Title
Bandit Online Optimization over the Permutahedron.
Abstract
The permutahedron is the convex polytope with vertex set consisting of the vectors (π(1),…,π(n)) for all permutations (bijections) π over {1,…,n}. We study a bandit game in which, at each step t, an adversary chooses a hidden weight vector st, a player chooses a vertex πt of the permutahedron and suffers an observed instantaneous loss of ∑i=1nπt(i)st(i).
Year
DOI
Venue
2013
10.1016/j.tcs.2016.07.033
Theoretical Computer Science
Keywords
DocType
Volume
Combinatorial online prediction,Bandit,Permutation,Permutahedron
Journal
650
ISSN
Citations 
PageRank 
0304-3975
2
0.38
References 
Authors
8
3
Name
Order
Citations
PageRank
Nir Ailon1111470.74
Kohei Hatano220.38
Eiji Takimoto320.38