25 citations · 121 across the 26 of their papers we have counts for
6 papers · 1 filter
The Role of Transparency in Repeated First-Price Auctions with Unknown Valuations
Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni +2
We study the problem of regret minimization for a single bidder in a sequence of first-price auctions where the bidder discovers the item's value only if the auction is won. Our ma…
Bandits with Replenishable Knapsacks: the Best of both Worlds
Martino Bernasconi, Matteo Castiglioni, Andrea Celli +1
The bandits with knapsack (BwK) framework models online decision-making problems in which an agent makes a sequence of decisions subject to resource consumption constraints. The tr…
Fully Dynamic Submodular Maximization over Matroids
Paul Dütting, Federico Fusco, Silvio Lattanzi +2
Maximizing monotone submodular functions under a matroid constraint is a classic algorithmic problem with multiple applications in data mining and machine learning. We study this c…
Fairness in Streaming Submodular Maximization over a Matroid Constraint
Marwa El Halabi, Federico Fusco, Ashkan Norouzi-Fard +2
Streaming submodular maximization is a natural model for the task of selecting a representative subset from a large-scale dataset. If datapoints have sensitive attributes such as g…
Pandora's Problem with Combinatorial Cost
Ben Berger, Tomer Ezra, Michal Feldman +1
Pandora's problem is a fundamental model in economics that studies optimal search strategies under costly inspection. In this paper we initiate the study of Pandora's problem with…
Repeated Bilateral Trade Against a Smoothed Adversary
Nicolò Cesa-Bianchi, Tommaso Cesari, Roberto Colomboni +2
We study repeated bilateral trade where an adaptive -smooth adversary generates the valuations of sellers and buyers. We provide a complete characterization of the regret regime…