arXiv Machine Learning
On The Limited Cost of Consistency In Points-Based Rewards Programs
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Jul 16
Efficiency, Feasibility, and Incentive-Awareness in Constrained Online Resource Allocation
arXiv:2507. 09473v2 Announce Type: replace-cross Abstract: We study the dynamic allocation of indivisible resources to strategic agents under long-term constraints, where the planner aims to maximize social welfare, satisfy multiple constraints, and elicit near-truthful reports.
arXiv Machine Learning
Jul 21
Regret Minimization for Piecewise Linear Rewards: Contracts, Auctions, and Beyond
arXiv:2503. 01701v2 Announce Type: replace-cross Abstract: Most microeconomic models of interest involve optimizing a piecewise linear function.
arXiv Machine Learning
Aug 18
Learning to Price with Persuasion
arXiv:2608. 16699v1 Announce Type: cross Abstract: Motivated by modern marketplaces, where the platform or the seller routinely gathers detailed user profiles, we study a novel learning theoretic model that simultaneously involves information and mechanism design.
arXiv Machine Learning
Jul 27
Carpe Diem: Critical Learning Period-Aware Contract-Based Incentives for Federated Learning
arXiv:2503. 07869v4 Announce Type: replace Abstract: Critical learning periods (CLPs) in federated learning (FL) refer to early stages during which low-quality contributions (e.
arXiv Machine Learning
Jun 19
Matching Markets meet Cumulative Prospect Theory: Towards Optimal and Adversarially Robust Learning
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.
arXiv Machine Learning
Jul 14
Diversified Multinomial Logit Contextual Bandits
arXiv:2607. 11684v1 Announce Type: cross Abstract: Existing contextual multinomial logit (MNL) bandits model relevance-driven choice but ignore the potential benefits of within-assortment diversity, while submodular/combinatorial bandits encode diversity in rewards but lack structured choice probabilities.