English
Related papers

Related papers: Escrows are optics

200 papers

In object systems, classes take the role of modules, and interfaces consist of methods. Because methods are encapsulated in objects, interfaces in object systems do not allow abstracting over \emph{where} methods are implemented. This…

Programming Languages · Computer Science 2011-10-18 David Lievens , Bill Harrison

Conditional independence has been widely used in AI, causal inference, machine learning, and statistics. We introduce categoroids, an algebraic structure for characterizing universal properties of conditional independence. Categoroids are…

Artificial Intelligence · Computer Science 2022-08-25 Sridhar Mahadevan

Simple optics are defined using actions of monoidal categories. Compound optics arise, for instance, as natural transformations between polynomial functors. Since a monoidal category is a special case of a bicategory, we formulate complex…

Category Theory · Mathematics 2022-03-24 Bartosz Milewski

When formalizing mathematics in (generalized predicative) constructive type theories, or more practically in proof assistants such as Coq or Agda, one is often using setoids (types with explicit equivalence relations). In this note we…

Logic · Mathematics 2013-04-23 Erik Palmgren

As algorithmic trading and electronic markets continue to transform the landscape of financial markets, detecting and deterring rogue agents to maintain a fair and efficient marketplace is crucial. The explosion of large datasets and the…

Trading and Market Microstructure · Quantitative Finance 2024-03-21 Kaushalya Kularatnam , Tania Stathaki

Bimorphic lenses are a simplification of polymorphic lenses that (like polymorphic lenses) have a type defined by 4 parameters, but which are defined in a monomorphic type system (i.e. an ordinary category with finite products). We show…

Category Theory · Mathematics 2019-08-27 Jules Hedges

We consider an economic environment with one buyer and one seller. For a bundle $(t,q)\in [0,\infty[\times [0,1]=\mathbb{Z}$, $q$ refers to the winning probability of an object, and $t$ denotes the payment that the buyer makes. We consider…

Computer Science and Game Theory · Computer Science 2024-12-17 Mridu Prabal Goswami

Market manipulation is a strategy used by traders to alter the price of financial securities. One type of manipulation is based on the process of buying or selling assets by using several trading strategies, among them spoofing is a popular…

Trading and Market Microstructure · Quantitative Finance 2015-11-04 Enrique Martínez-Miranda , Peter McBurney , Matthew J. Howard

We introduce a framework where the announcements of a clearinghouse about the allocation process are opaque in the sense that there can be more than one outcome compatible with a realization of type reports. We ask whether desirable…

Theoretical Economics · Economics 2024-08-09 Aram Grigoryan , Markus Möller

The goal of this article is to understand some interesting features of sequences of arbitrage operations, which look relevant to various processes in Economics and Finances. In the second part of the paper, analysis of sequences of…

Trading and Market Microstructure · Quantitative Finance 2010-04-06 Victor Kozyakin , Brian O'Callaghan , Alexei Pokrovskii

A weak asynchronous system is a trace monoid with a partial action on a set. A polygonal morphism between weak asynchronous systems commutes with the actions and preserves the independence of events. We prove that the category of weak…

Logic in Computer Science · Computer Science 2019-08-06 Ahmet A. Husainov

A growing body of work in economics and computation focuses on the trade-off between implementability and simplicity in mechanism design. The goal is to develop a theory that not only allows to design an incentive structure easy to grasp…

Computer Science and Game Theory · Computer Science 2024-03-14 Diodato Ferraioli , Carmine Ventre

Since categories are graphs with additional "structure", one should start from fuzzy graphs in order to define a theory of fuzzy categories. Thus is makes sense to introduce categories whose morphisms are associated with a plausibility…

Logic in Computer Science · Computer Science 2014-10-07 Apostolos Syropoulos

An open market is a subset of an entire equity market composed of a certain fixed number of top capitalization stocks. Though the number of stocks in the open market is fixed, the constituents of the market change over time as each…

Mathematical Finance · Quantitative Finance 2020-01-01 Donghan Kim

We define a concept which we call multiplicity. First, multiplicity of a morphism is defined. Then the multiplicity of an object over another object is defined to be the minimum of the multiplicities of all morphisms from one to another.…

Category Theory · Mathematics 2015-03-17 Kouki Taniyama

The present work investigates a type of morphisms between encryption schemes, called bridges. By associating an encryption scheme to every such bridge, we define and examine their security. Inspired by the bootstrapping procedure used by…

Cryptography and Security · Computer Science 2026-03-24 Mugurel Barcau , Cristian Lupascu , Vicentiu Pasol , George C. Turcas

Cloaking is a method of making obstacles undetectable. Here we cloak unit cells of a magnetic pattern squeezed into an otherwise periodic pattern from a magnetically driven colloidal flow. We apply a time-periodic external magnetic field…

Lenses, optics and dependent lenses (or equivalently morphisms of containers, or equivalently natural transformations of polynomial functors) are all widely used in applied category theory as models of bidirectional processes. From the…

Category Theory · Mathematics 2021-12-22 Dylan Braithwaite , Matteo Capucci , Bruno Gavranović , Jules Hedges , Eigil Fjeldgren Rischel

In voting theory, bribery is a form of manipulative behavior in which an external actor (the briber) offers to pay the voters to change their votes in order to get her preferred candidate elected. We investigate a model of bribery where the…

Computer Science and Game Theory · Computer Science 2015-05-13 E. Elkind , P. Faliszewski , A. Slinko

Comparison-based algorithms are algorithms for which the execution of each operation is solely based on the outcome of a series of comparisons between elements. Comparison-based computations can be naturally represented via the following…

Data Structures and Algorithms · Computer Science 2020-11-17 Michel Schellekens
‹ Prev 1 3 4 5 6 7 10 Next ›