Related papers: Sequences of Arbitrages
Economic theory has provided an estimable intuition in understanding the perplexing ideologies in law, in the areas of economic law, tort law, contract law, procedural law and many others. Most legal systems require the parties involved in…
In this note we introduce a new technique to answer an issue posed in [7] concerning geometric properties of the set of non-surjective linear operators. We also extend and improve a related result from the same paper.
We produce a long exact sequence whose terms are unit groups of associative algebras that behave as inner automorphisms of a given tensor. Our sequence generalizes known sequences for associative and non-associative algebras. In a manner…
This paper has two central aims: first, to provide simple conditions under which the generalized games in choice form and, consequently, the abstract economies, admit equilibrium; second, to study the solvability of several types of systems…
We introduce the notions of Collective Arbitrage and of Collective Super-replication in a discrete-time setting where agents are investing in their markets and are allowed to cooperate through exchanges. We accordingly establish versions of…
This note develops an arbitrage theory for a discrete-time market model without the assumption of the existence of a num\'eraire asset. Fundamental theorems of asset pricing are stated and proven in this context. The distinction between the…
This paper examines the role of algorithmic trading in modern financial markets. Additionally, order types, characteristics, and special features of algorithmic trading are described under the lens provided by the large development of high…
An 'arithmetic circuit' is a labeled, acyclic directed graph specifying a sequence of arithmetic and logical operations to be performed on sets of natural numbers. Arithmetic circuits can also be viewed as the elements of the smallest…
We consider a financial market in discrete time and study pricing and hedging conditional on the information available up to an arbitrary point in time. In this conditional framework, we determine the structure of arbitrage-free prices.…
We refine a model for linear logic based on two well-known ingredients: games and simulations. We have already shown that usual simulation relations form a sound notion of morphism between games; and that we can interpret all linear logic…
Algebras of Logic deal with some algebraic structures, often bounded lattices, considered as models of certain logics, including logic as a domain of order theory. There are well known their importance and applications in social life to…
Using semi-tensor product of matrices, the structures of several kinds of symmetric games are investigated via the linear representation of symmetric group in the structure vector of games as its representation space. First of all, the…
As automated decision making and decision assistance systems become common in everyday life, research on the prevention or mitigation of potential harms that arise from decisions made by these systems has proliferated. However, various…
How do sequence models represent their decision-making process? Prior work suggests that Othello-playing neural network learned nonlinear models of the board state (Li et al., 2023). In this work, we provide evidence of a closely related…
We consider a popular model of microeconomics with countably many assets: the Arbitrage Pricing Model. We study the problem of optimal investment under an expected utility criterion and look for conditions ensuring the existence of optimal…
We review the state of the art of clustering financial time series and the study of their correlations alongside other interaction networks. The aim of this review is to gather in one place the relevant material from different fields, e.g.…
An arbitrage strategy allows a financial agent to make certain profit out of nothing, i.e., out of zero initial investment. This has to be disallowed on economic basis if the market is in equilibrium state, as opportunities for riskless…
We present a form of algebraic reasoning for computational objects which are expressed as graphs. Edges describe the flow of data between primitive operations which are represented by vertices. These graphs have an interface made of…
An algorithm is discussed for converting a class of recursive processes to a parallel system. It is argued that this algorithm can be superior to certain methods currently found in the literature for an important subset of problems. The…
In the study of discrete dynamical systems, we typically start with a function from a space into itself, and ask questions about the properties of sequences of iterates of the function. In this paper we reverse the direction of this study.…