An -regret analysis of adversarial bilateral trade
From MaRDI portal
Recommendations
Cites work
- (Almost) efficient mechanisms for bilateral trading
- Adaptive contract design for crowdsourcing markets: bandit algorithms for repeated principal-agent problems
- Adversarial bandits with knapsacks
- Algorithmic Game Theory
- Approximately efficient bilateral trade
- Approximately Efficient Double Auctions with Strong Budget Balance
- Bilateral Trade: A Regret Minimization Perspective
- Efficient algorithms for online decision problems
- Efficient mechanisms for bilateral trading
- Efficient online linear optimization with approximation algorithms
- Efficient two-sided markets with limited information
- Fixed price approximability of the optimal gain from trade
- Improved approximation ratios of fixed-price mechanisms in bilateral trades
- Introduction to multi-armed bandits
- Learning and Efficiency in Games with Dynamic Population
- Multi-scale online learning: theory and applications to online auctions and pricing
- Near-optimal online auctions
- Nonstochastic Multi-Armed Bandits with Graph-Structured Feedback
- On the optimal fixed-price mechanism in bilateral trade
- Online learning in online auctions
- Partial monitoring -- classification, regret bounds, and algorithms
- Playing Games with Approximation Algorithms
- Prediction, Learning, and Games
- Regret Minimization for Reserve Prices in Second-Price Auctions
- Regret minimization in online Bayesian persuasion: handling adversarial receiver's types under full and partial feedback models
- Robust trading mechanisms
- The multiplicative weights update method: a meta-algorithm and applications
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)
