Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

0111 · Aug 201619922001200920172026
6 results for merit-based

New algorithms ensure fair selection in combinatorial semi-bandit with unrestricted delays.

problem Fair selection in stochastic combinatorial semi-bandit with delayed feedback.
method Introduced merit-based fairness constraints and new bandit algorithms for reward and fairness.
result Achieved sublinear expected reward and fairness regrets with dependence on delay distribution quantiles.

A new learning-to-rank approach ensures fairness for item providers in dynamic ranking systems.

problem Myopically optimizing user utility can be unfair to item providers in two-sided markets.
method A controller that integrates unbiased estimators for fairness and utility, dynamically adapting as more data becomes available.
result Empirically, the algorithm is highly practical and robust, ensuring amortized group fairness.

Quantitative analysis of soccer players' passing ability focuses on descriptive statistics without considering the players' real contribution to the passing and ball possession strategy of their team. Which player is able to help the build-up of an attack, or to maintain the possession of the ball? We introduce a novel…

2016-08-08abs ↗pdf ↗

Delegated votes in Uniswap DAO favor parties with less self-owned votes and a16z-affiliated entities.

problem Incentives for vote delegation in decentralized governance systems.
method Analysis of Uniswap governance DAO using vote delegation data.
result Vote delegation patterns suggest window-dressing around decentralization and merit-based delegation.

While implicit feedback (e.g., clicks, dwell times, etc.) is an abundant and attractive source of data for learning to rank, it can produce unfair ranking policies for both exogenous and endogenous reasons. Exogenous reasons typically manifest themselves as biases in the training data, which then get reflected in the l…

2019-11-19abs ↗pdf ↗

This paper tackles fair online decision-making in contextual bandits, achieving optimal performance and fairness.

problem Fairness in online decision-making systems under strategic manipulation.
method Develops algorithms for linear and smooth reward functions, maintaining fairness and optimal regret.
result Achieves nearly minimax-optimal regret with strong fairness guarantees, even in the presence of attacks.