淡江大學機構典藏:Item 987654321/121348
English  |  正體中文  |  简体中文  |  全文筆數/總筆數 : 64176/96941 (66%)
造訪人次 : 9106489      線上人數 : 12465
RC Version 7.0 © Powered By DSPACE, MIT. Enhanced by NTU Library & TKU Library IR team.
搜尋範圍 查詢小技巧:
  • 您可在西文檢索詞彙前後加上"雙引號",以獲取較精準的檢索結果
  • 若欲以作者姓名搜尋,建議至進階搜尋限定作者欄位,可獲得較完整資料
  • 進階搜尋
    請使用永久網址來引用或連結此文件: https://tkuir.lib.tku.edu.tw/dspace/handle/987654321/121348


    題名: Profitable Prediction Market Making
    作者: Chen, Po-An;Chen, Yiling;Lu, Chi-Jen;Lin, Chuang-Chieh
    關鍵詞: Online learning;market making;no-regret algorithms
    日期: 2021-10-22
    上傳時間: 2021-09-24 12:15:41 (UTC+8)
    摘要: We take advantage of the correspondence between online learning algorithms design for
    negative regrets under certain predictable (or regular) losses and protable prediction market makers
    design under some patterns of trade sequences. Thus, we adopt the optimistic (or double) lazy-update
    mirror descent algorithm: when in each time step, a leader is called a \strong" one compared with the
    other non-minimizers in terms of its much little current cumulative loss, the regret would be negative
    in this case, and the more frequent changes of leaders the more negative of the regret. Moreover, if
    the immediately previous loss vector is a good estimator of the current loss vector, the regret stays
    negative. On the other hand, we are using the modified double-update multiplicative update algorithm of for catching the switches of \dominant experts" quickly enough to beat a fixed best expert in
    hindsight in cumulative losses thereby to obtain negative regrets.
    關聯: Proceedings of the 14th Annual Meeting of the Asian Association for Algorithms and Computation (AAAC'2021)
    顯示於類別:[資訊工程學系暨研究所] 會議論文

    文件中的檔案:

    檔案 大小格式瀏覽次數
    index.html0KbHTML226檢視/開啟

    在機構典藏中所有的資料項目都受到原著作權保護.

    TAIR相關文章

    DSpace Software Copyright © 2002-2004  MIT &  Hewlett-Packard  /   Enhanced by   NTU Library & TKU Library IR teams. Copyright ©   - 回饋