arXiv:2606. 15369v1 Announce Type: new Abstract: We study repeated bilateral trade from a fairness perspective.
Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.
We study repeated bilateral trade from a fairness perspective. At each round, a fresh seller-buyer pair arrives, and the platform posts a price before observing the traders' valuations.
arXiv:2606. 01159v1 Announce Type: new Abstract: We study two-player zero-sum games (TPZSGs) with bandit feedback under fairness constraints requiring every action to be played with probability at least $\alpha/m$.
The paper studies contextual bilateral trade with full feedback, showing that action-independent observations eliminate the usual polynomial adaptation penalty seen in heavy-tailed bandits. It presents fully parameter-free algorithms that achieve oracle minimax regret rates without knowing the moment order or scale, and derives new regret bounds for both parametric and nonparametric settings. The key technical insight is a paired squared‑loss statistic whose noise cancels, enabling model selection and yielding regret rates that interpolate between classical nonparametric and linear extremes.
arXiv:2607. 20694v1 Announce Type: new Abstract: Personal and organizational planning systems maintain two records that drift apart: what was planned (a task's effort budget) and what was done (a logged action's duration and description).
arXiv:2602.04125v2 Announce Type: replace-cross Abstract: Modern digital platforms use contextual bandits to allocate valuable exposure and opportunities among competing participants. Fair treatment...
arXiv:2606. 19883v1 Announce Type: new Abstract: We study a multi-agent multi-armed bandit problem in the competitive setup with two-sided matching markets under a human centric decision making model.