Taihei Oki

Our paper "Ascending Auctions for Combinatorial Markets with Frictions: A Unified Framework via Discrete Convex Analysis" (with @taihei_oki ) was accepted to EC'26!

A new paper with @taihei_oki on online inverse linear optimization is now available on arXiv! 🚀🚀 Check it out: arxiv.org/pdf/2602.01682 We establish a finite regret bound for M-convex action sets, which cover many combinatorial action sets, and extend it to corrupted feedback.

Our new paper is out! On the fair division problem for individual goods, this paper introduces and investigates the "position envy-freeness," a fairness notion regarding agents' ordering, and its EF1-like extension. arxiv.org/abs/2409.06423

Our new paper is out! arxiv.org/abs/2411.06771 We settled the "proximity conjecture" for group-labeled sparse paving matroids. We also dealt with the multiple group-label setting!

〈プレスリリース〉国家戦略分野の若手研究者及び博士後期課程学生の育成事業（#BOOST）次世代AI人材育成プログラム（若手研究者支援）における令和6年度新規研究課題の決定について jst.go.jp/pr/info/info17… 325件の応募があり、80件の研究課題を採択しました。 #JST #科学技術振興機構

The full version of our paper "Algebraic algorithms for fractional linear matroid parity via non-commutative rank" (w. Tasuku Soma) has been accepted to SIAM Journal of Computing 🎉 arxiv.org/abs/2207.07946