12 citations · 15 across the 6 of their papers we have counts for
Showing 2026Show all
2 papers · 1 filter
cs.GT2026
Ascending Auctions for Combinatorial Markets with Frictions: A Unified Framework via Discrete Convex Analysis
Taihei Oki, Ryosuke Sato
We develop a unified ascending-auction framework for computing Walrasian equilibria in combinatorial markets with strong substitutes valuations and piecewise-linear payment functio…
cs.LG2026
Finite and Corruption-Robust Regret Bounds in Online Inverse Linear Optimization under M-Convex Action Sets
Taihei Oki, Shinsaku Sakaue
We study online inverse linear optimization, also known as contextual recommendation, where a learner sequentially infers an agent's hidden objective vector from observed optimal a…