2019-08-24T20:08:28Zhttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_oaipmhoai:ipsj.ixsq.nii.ac.jp:000729152018-03-30T07:23:32Z01164:02592:06240:06332
Online Prediction over PermutahedronOnline Prediction over Permutahedronenghttp://id.nii.ac.jp/1001/00072915/Technical Reporthttps://ipsj.ixsq.nii.ac.jp/ej/?action=repository_action_common_download&item_id=72915&item_no=1&attribute_id=1&file_no=1Copyright (c) 2011 by the Information Processing Society of JapanDepartment of Informatics, Kyushu University.Department of Informatics, Kyushu University.Department of Informatics, Kyushu University.Department of Informatics, Kyushu University.Department of Informatics, Kyushu University.Shota, YasutakeKohei, HatanoShuji, KijimaEiji, TakimotoMasayuki, TakedaWe consider an online prediction problem where the player is supposed to predict a permutation of n fixed objects at each trial. This problem is motivated by a scheduling problem whose objective is to minimize the sum of waiting times of n sequential tasks. We propose an online prediction algorithm which predicts almost as well as the best fixed permutation in hindsight.We consider an online prediction problem where the player is supposed to predict a permutation of n fixed objects at each trial. This problem is motivated by a scheduling problem whose objective is to minimize the sum of waiting times of n sequential tasks. We propose an online prediction algorithm which predicts almost as well as the best fixed permutation in hindsight.AN1009593X研究報告アルゴリズム（AL）2011-AL-13412182011-02-282011-02-22