A marketplace for data: An algorithmic solution

A Agarwal, M Dahleh, T Sarkar - … of the 2019 ACM Conference on …, 2019 - dl.acm.org
In this work, we aim to design a data marketplace; a robust real-time matching mechanism to
efficiently buy and sell training data for Machine Learning tasks. While the monetization of …

Prophet inequalities made easy: Stochastic optimization by pricing nonstochastic inputs

P Dutting, M Feldman, T Kesselheim, B Lucier - SIAM Journal on Computing, 2020 - SIAM
We present a general framework for stochastic online maximization problems with
combinatorial feasibility constraints. The framework establishes prophet inequalities by …

Optimal rates and efficient algorithms for online Bayesian persuasion

M Bernasconi, M Castiglioni, A Celli… - International …, 2023 - proceedings.mlr.press
Bayesian persuasion studies how an informed sender should influence beliefs of rational
receivers that take decisions through Bayesian updating of a common prior. We focus on the …

[PDF][PDF] No-regret learning in bilateral trade via global budget balance

M Bernasconi, M Castiglioni, A Celli… - Proceedings of the 56th …, 2024 - dl.acm.org
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 …

The price of anarchy in auctions

T Roughgarden, V Syrgkanis, E Tardos - Journal of Artificial Intelligence …, 2017 - jair.org
This survey outlines a general and modular theory for proving approximation guarantees for
equilibria of auctions in complex settings. This theory complements traditional economic …

Discovering auctions: Contributions of Paul Milgrom and Robert Wilson

A Teytelboym, S Li, SD Kominers… - The Scandinavian …, 2021 - Wiley Online Library
Abstract The 2020 Sveriges Riksbank Prize in Economic Sciences in Memory of Alfred
Nobel was awarded to Paul R. Milgrom and Robert B. Wilson for “improvements to auction …

Contracting with a learning agent

G Guruganesh, Y Kolumbus, J Schneider… - arxiv preprint arxiv …, 2024 - arxiv.org
Many real-life contractual relations differ completely from the clean, static model at the heart
of principal-agent theory. Typically, they involve repeated strategic interactions of the …

Reinforcement Mechanism Design for e-commerce

Q Cai, A Filos-Ratsikas, P Tang, Y Zhang - … of the 2018 World Wide Web …, 2018 - dl.acm.org
We study the problem of allocating impressions to sellers in e-commerce websites, such as
Amazon, eBay or Taobao, aiming to maximize the total revenue generated by the platform …

Auctions between regret-minimizing agents

Y Kolumbus, N Nisan - Proceedings of the ACM Web Conference 2022, 2022 - dl.acm.org
We analyze a scenario in which software agents implemented as regret-minimizing
algorithms engage in a repeated auction on behalf of their users. We study first-price and …

An -regret analysis of Adversarial Bilateral Trade

Y Azar, A Fiat, F Fusco - Advances in Neural Information …, 2022 - proceedings.neurips.cc
We study sequential bilateral trade where sellers and buyers valuations are completely
arbitrary ({\sl ie}, determined by an adversary). Sellers and buyers are strategic agents with …