[PDF][PDF] No-regret learning in bilateral trade via global budget balance
Bilateral trade models the problem of intermediating between two rational agents—a seller
and a buyer—both characterized by a private valuation for an item they want to trade. We …
and a buyer—both characterized by a private valuation for an item they want to trade. We …
Gender preferences in job vacancies and workplace gender diversity
Abstract In Spring 2005, the Ombud for Equal Treatment in Austria launched a campaign
notifying employers and newspapers that gender preferences in job ads were illegal. At the …
notifying employers and newspapers that gender preferences in job ads were illegal. At the …
Online Bidding Algorithms for Return-on-Spend Constrained Advertisers✱
We study online auto-bidding algorithms for a single advertiser maximizing value under the
Return-on-Spend (RoS) constraint, quantifying performance in terms of regret relative to the …
Return-on-Spend (RoS) constraint, quantifying performance in terms of regret relative to the …
Online Learning under Budget and ROI Constraints via Weak Adaptivity
We study online learning problems in which a decision maker has to make a sequence of
costly decisions, with the goal of maximizing their expected reward while adhering to budget …
costly decisions, with the goal of maximizing their expected reward while adhering to budget …
User strategization and trustworthy algorithms
Many human-facing algorithms--including those that power recommender systems or hiring
decision tools--are trained on data provided by their users. The developers of these …
decision tools--are trained on data provided by their users. The developers of these …
Multi-task and meta-learning with sparse linear bandits
Motivated by recent developments on meta-learning with linear contextual bandit tasks, we
study the benefit of feature learning in both the multi-task and meta-learning settings. We …
study the benefit of feature learning in both the multi-task and meta-learning settings. We …
Learning and collusion in multi-unit auctions
S Brânzei, M Derakhshan… - Advances in Neural …, 2023 - proceedings.neurips.cc
In a carbon auction, licenses for CO2 emissions are allocated among multiple interested
players. Inspired by this setting, we consider repeated multi-unit auctions with uniform …
players. Inspired by this setting, we consider repeated multi-unit auctions with uniform …
Learning to Bid in Contextual First Price Auctions✱
In this work, we investigate the problem of how to bid in repeated contextual first price
auctions for a single learner (the bidder). Concretely, at each time t, the learner receives a …
auctions for a single learner (the bidder). Concretely, at each time t, the learner receives a …
Intelligent Agents for Auction-based Federated Learning: A Survey
Auction-based federated learning (AFL) is an important emerging category of FL incentive
mechanism design, due to its ability to fairly and efficiently motivate high-quality data owners …
mechanism design, due to its ability to fairly and efficiently motivate high-quality data owners …
Posted pricing and dynamic prior-independent mechanisms with value maximizers
We study posted price auctions and dynamic prior-independent mechanisms for (ROI-
constrained) value maximizers. In contrast to classic (quasi-linear) utility maximizers, these …
constrained) value maximizers. In contrast to classic (quasi-linear) utility maximizers, these …