An \(\alpha \)-regret analysis of adversarial bilateral trade
From MaRDI portal
Publication:6665707
DOI10.1016/J.ARTINT.2024.104231MaRDI QIDQ6665707
Federico Fusco, Yossi Azar, Amos Fiat
Publication date: 17 January 2025
Published in: Artificial Intelligence (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Efficient mechanisms for bilateral trading
- Robust trading mechanisms
- Online learning in online auctions
- Efficient algorithms for online decision problems
- (Almost) efficient mechanisms for bilateral trading
- Regret minimization in online Bayesian persuasion: handling adversarial receiver's types under full and partial feedback models
- Regret Minimization for Reserve Prices in Second-Price Auctions
- Adaptive Contract Design for Crowdsourcing Markets: Bandit Algorithms for Repeated Principal-Agent Problems
- Playing Games with Approximation Algorithms
- Learning and Efficiency in Games with Dynamic Population
- Approximately Efficient Double Auctions with Strong Budget Balance
- Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback
- Fixed Price Approximability of the Optimal Gain from Trade
- Efficient Online Linear Optimization with Approximation Algorithms
- Introduction to Multi-Armed Bandits
- Partial Monitoring—Classification, Regret Bounds, and Algorithms
- Algorithmic Game Theory
- Prediction, Learning, and Games
- Efficient two-sided markets with limited information
- Approximately efficient bilateral trade
- Bilateral Trade: A Regret Minimization Perspective
- On the optimal fixed-price mechanism in bilateral trade
- Improved approximation ratios of fixed-price mechanisms in bilateral trades
- Adversarial bandits with knapsacks
This page was built for publication: An \(\alpha \)-regret analysis of adversarial bilateral trade
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6665707)
