pub struct AvellanedaImpact {
pub gamma: f64,
pub sigma: f64,
pub kappa: f64,
pub a: f64,
pub xi: f64,
}Expand description
Avellaneda-Stoikov Model with Market Impact
Models a market maker whose trades permanently impact the mid-price. The inventory penalty is adjusted implicitly by the cost of moving the price against oneself.
§Dynamics
- $S_t \to S_t + \xi$ (Buy) or $S_t - \xi$ (Sell)
- Impact is linear and permanent.
Fields§
§gamma: f64§sigma: f64§kappa: f64§a: f64§xi: f64Permanent market impact parameter ($\xi$). A trade of size 1 moves the price by $\xi$.
Implementations§
Source§impl AvellanedaImpact
impl AvellanedaImpact
Sourcepub fn get_spreads(&self, derivs: &StateDerivatives<2>, q: f64) -> (f64, f64)
pub fn get_spreads(&self, derivs: &StateDerivatives<2>, q: f64) -> (f64, f64)
Computes optimal spreads, adjusted for market impact.
Sourcepub fn fill_rate_base(&self, _state: &[f64; 2]) -> f64
pub fn fill_rate_base(&self, _state: &[f64; 2]) -> f64
The base arrival intensity used for intensity-to-spread conversion.
Sourcepub fn fill_rate_decay(&self) -> f64
pub fn fill_rate_decay(&self) -> f64
The fill-rate decay parameter used for intensity-to-spread conversion.
Trait Implementations§
Source§impl Clone for AvellanedaImpact
impl Clone for AvellanedaImpact
Source§fn clone(&self) -> AvellanedaImpact
fn clone(&self) -> AvellanedaImpact
Returns a duplicate of the value. Read more
1.0.0 (const: unstable) · Source§fn clone_from(&mut self, source: &Self)
fn clone_from(&mut self, source: &Self)
Performs copy-assignment from
source. Read moreSource§impl ControlProblem<2> for AvellanedaImpact
impl ControlProblem<2> for AvellanedaImpact
Source§type Control = MarketMakingControl
type Control = MarketMakingControl
The action type. For Merton this is a scalar portfolio fraction; for
market making it is a pair of bid/ask intensities.
Source§fn optimize(
&self,
_t: f64,
state: &[f64; 2],
derivs: &StateDerivatives<2>,
) -> Self::Control
fn optimize( &self, _t: f64, state: &[f64; 2], derivs: &StateDerivatives<2>, ) -> Self::Control
Returns the control that maximizes the driver at
(t, state).Source§fn running_reward(
&self,
_t: f64,
_state: &[f64; 2],
control: &Self::Control,
) -> f64
fn running_reward( &self, _t: f64, _state: &[f64; 2], control: &Self::Control, ) -> f64
Returns the running reward
f(t,x,u).Source§fn bsde_driver(
&self,
t: f64,
state: &[f64; 2],
control: &Self::Control,
derivs: &StateDerivatives<2>,
_dt: f64,
) -> f64
fn bsde_driver( &self, t: f64, state: &[f64; 2], control: &Self::Control, derivs: &StateDerivatives<2>, _dt: f64, ) -> f64
Returns the backward driver consumed by the BSDE regression solver. Read more
Source§fn generator(
&self,
_t: f64,
state: &[f64; 2],
_control: &Self::Control,
_derivs: &StateDerivatives<2>,
) -> f64
fn generator( &self, _t: f64, state: &[f64; 2], _control: &Self::Control, _derivs: &StateDerivatives<2>, ) -> f64
Returns the infinitesimal generator
L^u V for the given control and
derivative bundle.Source§fn constant_discount_rate(&self) -> Option<f64>
fn constant_discount_rate(&self) -> Option<f64>
Constant discount rate hint. Defaults to
None (state dependent).Source§fn next_step(
&self,
_t: f64,
state: &[f64; 2],
dt: f64,
noise: &[f64; 2],
) -> [f64; 2]
fn next_step( &self, _t: f64, state: &[f64; 2], dt: f64, noise: &[f64; 2], ) -> [f64; 2]
Advances the state one step under the optimal control at forward time
t.Source§fn next_step_controlled(
&self,
_t: f64,
state: &[f64; 2],
control: &Self::Control,
dt: f64,
noise: &[f64; 2],
) -> [f64; 2]
fn next_step_controlled( &self, _t: f64, state: &[f64; 2], control: &Self::Control, dt: f64, noise: &[f64; 2], ) -> [f64; 2]
Advances the state one step under an explicitly supplied control. Read more
Source§fn is_reduced_value(&self) -> bool
fn is_reduced_value(&self) -> bool
Whether the value this problem solves is a reduced value. Read more
Source§fn is_diffusion_dimension(&self, dim: usize) -> bool
fn is_diffusion_dimension(&self, dim: usize) -> bool
Whether a dimension is driven by Brownian diffusion.
Source§fn gradient_step(&self, _dim: usize) -> f64
fn gradient_step(&self, _dim: usize) -> f64
Physical finite-difference step for a dimension, used by mesh-free
gradient stencils.
Source§impl PdeProblem<2> for AvellanedaImpact
impl PdeProblem<2> for AvellanedaImpact
Source§fn dimension_kind(&self, dim: usize) -> DimensionKind
fn dimension_kind(&self, dim: usize) -> DimensionKind
Discretization kind for
dim. Read moreSource§fn transport(
&self,
_t: f64,
state: &[f64; 2],
control: &Self::Control,
derivs: &StateDerivatives<2>,
) -> Transport<2>
fn transport( &self, _t: f64, state: &[f64; 2], control: &Self::Control, derivs: &StateDerivatives<2>, ) -> Transport<2>
Transport and local source for the given control and derivatives. Read more
Source§fn jump_kernel(
&self,
_t: f64,
_state: &[f64; N],
_control: &Self::Control,
_derivs: &StateDerivatives<N>,
transport: &Transport<N>,
) -> JumpKernel<N>
fn jump_kernel( &self, _t: f64, _state: &[f64; N], _control: &Self::Control, _derivs: &StateDerivatives<N>, transport: &Transport<N>, ) -> JumpKernel<N>
Jump kernel for arbitrary-amplitude jump dimensions. Read more
Auto Trait Implementations§
impl Freeze for AvellanedaImpact
impl RefUnwindSafe for AvellanedaImpact
impl Send for AvellanedaImpact
impl Sync for AvellanedaImpact
impl Unpin for AvellanedaImpact
impl UnsafeUnpin for AvellanedaImpact
impl UnwindSafe for AvellanedaImpact
Blanket Implementations§
Source§impl<T> BorrowMut<T> for Twhere
T: ?Sized,
impl<T> BorrowMut<T> for Twhere
T: ?Sized,
Source§fn borrow_mut(&mut self) -> &mut T
fn borrow_mut(&mut self) -> &mut T
Mutably borrows from an owned value. Read more
impl<ST, DT> CastableFrom<ST, Initialized, Initialized> for DT
impl<ST, DT> CastableFrom<ST, Uninit, Uninit> for DT
Source§impl<T> CloneToUninit for Twhere
T: Clone,
impl<T> CloneToUninit for Twhere
T: Clone,
Source§impl<T> IntoEither for T
impl<T> IntoEither for T
Source§fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
fn into_either(self, into_left: bool) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left is true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read moreSource§fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
fn into_either_with<F>(self, into_left: F) -> Either<Self, Self> ⓘ
Converts
self into a Left variant of Either<Self, Self>
if into_left(&self) returns true.
Converts self into a Right variant of Either<Self, Self>
otherwise. Read more