Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
173 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Binary markets under transaction costs (1209.5254v1)

Published 24 Sep 2012 in math.PR

Abstract: The goal of this work is to study binary market models with transaction costs, and to characterize their arbitrage opportunities. It has been already shown that the absence of arbitrage is related to the existence of \lambda-consistent price systems (\lambda-CPS), and, for this reason, we aim to provide conditions under which such systems exist. More precisely, we give a characterization for the smallest transaction cost \lambda_c (called "critical" \lambda) starting from which one can construct a \lambda-consistent price system. We also provide an expression for the set M(\lambda) of all probability measures inducing \lambda-CPS. We show in particular that in the transition phase "\lambda=\lambda_c" these sets are empty if and only if the frictionless market admits arbitrage opportunities. As an application, we obtain an explicit formula for \lambda_c depending only on the parameters of the model for homogeneous and also for some semi-homogeneous binary markets.

Summary

We haven't generated a summary for this paper yet.