Online linear optimization over permutations

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

20 被引用数 (Scopus)

抄録

This paper proposes an algorithm for online linear optimization problem over permutations; the objective of the online algorithm is to find a permutation of {1,...,n} at each trial so as to minimize the "regret" for T trials. The regret of our algorithm is O(n 2√T ln n) in expectation for any input sequence. A naive implementation requires more than exponential time. On the other hand, our algorithm uses only O(n) space and runs in O(n 2) time in each trial. To achieve this complexity, we devise two efficient algorithms as subroutines: One is for minimization of an entropy function over the permutahedron P n , and the other is for randomized rounding over P n .

本文言語英語
ホスト出版物のタイトルAlgorithms and Computation - 22nd International Symposium, ISAAC 2011, Proceedings
ページ534-543
ページ数10
DOI
出版ステータス出版済み - 2011
イベント22nd International Symposium on Algorithms and Computation, ISAAC 2011 - Yokohama, 日本
継続期間: 12 5 201112 8 2011

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
7074 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他22nd International Symposium on Algorithms and Computation, ISAAC 2011
Country日本
CityYokohama
Period12/5/1112/8/11

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「Online linear optimization over permutations」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル