MLINFO COLLECTION

機械学習

記事一覧

5 / 5
arxiv

No-Regret Language Generation

We introduce no-regret generation, which requires a generator to make a sublinear number of mistakes uniformly over all demonstration sequences and compatible target languages. We also formulate an…

machine-learning
arxiv

On the Convergence of Iterated Round Robin

Round Robin (RR) is a simple and widely used picking sequence mechanism for allocating indivisible goods, known to guarantee envy-freeness up to one item (EF1) when preferences are additive. Despite…

machine-learning
arxiv

Online Fair Division with Upgrade Recourse

We study the online fair division of indivisible goods. In the standard model, where assignments are irrevocable, no algorithm can guarantee any positive fraction of the maximin share (MMS).

machine-learning
arxiv

Lasso Games

We study games on finite graphs with labelled or weighted edges in which plays end as soon as the first loop is formed. The resulting play has a lasso shape: a path (head) followed by a cycle (loop).

machine-learning