Bandit Market Makers

12/01/2011
by   Nicolás Della Penna, et al.
0

We introduce a modular framework for market making. It combines cost-function based automated market makers with bandit algorithms. We obtain worst-case profits guarantee's relative to the best in hindsight within a class of natural "overround" cost functions . This combination allow us to have distribution-free guarantees on the regret of profits while preserving the bounded worst-case losses and computational tractability over combinatorial spaces of the cost function based approach. We present simulation results to better understand the practical behaviour of market makers from the framework.

READ FULL TEXT
research
03/28/2023

Worst case tractability of linear problems in the presence of noise: linear information

We study the worst case tractability of multivariate linear problems def...
research
06/09/2016

Arbitrage-Free Combinatorial Market Making via Integer Programming

We present a new combinatorial market maker that operates arbitrage-free...
research
07/30/2014

Market Making with Decreasing Utility for Information

We study information elicitation in cost-function-based combinatorial pr...
research
09/05/2022

Convexifying Market Clearing of SoC-Dependent Bids from Merchant Storage Participants

State-of-charge (SoC) dependent bidding allows merchant storage particip...
research
01/03/2013

Follow the Leader If You Can, Hedge If You Must

Follow-the-Leader (FTL) is an intuitive sequential prediction strategy t...
research
08/30/2022

Competition, Alignment, and Equilibria in Digital Marketplaces

Competition between traditional platforms is known to improve user utili...
research
10/08/2018

Parallelisation of a Common Changepoint Detection Method

In recent years, various means of efficiently detecting changepoints in ...

Please sign up or login with your details

Forgot password? Click here to reset