arXiv Machine Learning
Jun 16
Repeated Bilateral Trade: The Quest for Fairness
arXiv:2606. 15369v1 Announce Type: new Abstract: We study repeated bilateral trade from a fairness perspective.
Repeated Bilateral Trade: The Quest for Fairness
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.
Related stories
arXiv Machine Learning
Jun 2
Fairness in two-player zero-sum games with bandit feedback
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$.
Hugging Face Trending Papers
Jun 28
Learning to Bid in Discriminatory Auctions with Budget Constraints
We study repeated bidding in multi-unit discriminatory (pay-as-bid) auctions for a single bidder with per-round utility equal to value minus $α$ times payment, where $α\in[0,1]$ is a cost-of-capital parameter. The bidder aims to maximize cumulative utility over $T$ rounds subject to a total budget $B$.
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
Jun 30
Learning to Bid in Discriminatory Auctions with Budget Constraints
arXiv:2606. 29252v1 Announce Type: new Abstract: We study repeated bidding in multi-unit discriminatory (pay-as-bid) auctions for a single bidder with per-round utility equal to value minus $\alpha$ times payment, where $\alpha\in[0,1]$ is a cost-of-capital parameter.
arXiv Machine Learning
Jun 16
Multi-User Dueling Bandits: A Fair Approach using Nash Social Welfare
arXiv:2605. 01961v2 Announce Type: replace Abstract: Learning from human preference data is becoming a useful tool, from fine-tuning large language models to training reinforcement learning agents.
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 24
Attribution Markets: A Fisher-Market Formulation for Fractional Credit Assignment Between Planned Tasks and Performed Actions
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 Machine Learning
Jul 14
Bilateral Trade Under Heavy-Tailed Valuations: Minimax Regret with Infinite Variance
arXiv:2603. 06851v2 Announce Type: replace-cross Abstract: We study contextual bilateral trade under full feedback when, conditionally on the context, trader valuations have bounded density but infinite variance.
arXiv Machine Learning
Aug 11
Regret, equilibrium, and learning in games: A guided tour
arXiv:2608. 09389v1 Announce Type: cross Abstract: This note aims to serve as an entry point to the literature on learning in games, a topic with significant theoretical appeal and a wide range of applications -- from machine learning and data science to economics and beyond.
arXiv Machine Learning
Jun 17
Learning in Matching Games with Bandit Feedback
arXiv:2506. 03802v2 Announce Type: replace Abstract: We introduce a learning problem in a generalized two-sided matching market, where agents select actions to interact with their match.
arXiv AI
Aug 5
Minimax-Optimal Semiparametric Contextual Dynamic Pricing with Multimodal Revenue
arXiv:2608. 03142v1 Announce Type: cross Abstract: We study contextual dynamic pricing with arbitrary covariate sequences and bounded, possibly nonbinary purchase quantities.