Related papers: A characterization of combinatorial demand
We give a characterization of the validity of the distributive law in a solid. There exists equivalence between the characterization and the modified axiom of distibutivity valid in a solid.
We consider a stochastic optimal control problem in a market model with temporary and permanent price impact, which is related to an expected utility maximization problem under finite fuel constraint. We establish the initial condition…
We give a combinatorial characterization of upward planar graphs in terms of upward planar orders, which are special linear extensions of edge posets.
The main aim of this note is to provide characterization theorems concerning real derivations. Among others the following implication will be verified: Assume that $\xi\colon \mathbb{R}\to \mathbb{R}$ is a given differentiable function and…
We introduce a `concrete complexity' model for studying algorithms for matching in bipartite graphs. The model is based on the "demand query" model used for combinatorial auctions. Most (but not all) known algorithms for bipartite matching…
We introduce different classical characteristics used to regularize a subharmonic function and compare them. As an application we give a complete proof of a useful characterization of the modulus of continuity of such functions in terms of…
Implementing a set of microeconomic criteria, we develop price dynamics equations using a function of demand/supply with key symmetry properties. The function of demand/supply can be linear or nonlinear. The type of function determines the…
We prove a characterization of the dual mixed volume in terms of functional properties of the polynomial associated to it. To do this, we use tools from the theory of multilinear operators on spaces of continuos functions. Along the way we…
We reverse-engineer the equilibrium construction process of asset prices in order to obtain returns which depend on firm characteristics, possibly in a linear fashion. One key requirement is that agents must have demands that rely…
Companion matrices of the second type are characterized by properties that involve bilinear maps.
The union of a collection of $n$ sets is generally expressed in terms of a characteristic (indicator) function that contains $2^{n}-1$ terms. In this article, a much simpler expression is found that requires the evaluation of $n$ terms…
The paper studies the complex differentiable functions of double argument and their properties, which are similar to the properties of the holomorphic functions of complex variable: the Cauchy formula, the hyperbolic harmonicity, the…
We characterize inclusions of compact noncommutative convex sets with the property that every continuous affine function on the smaller set can be extended to a continuous affine function on the larger set with a uniform bound. As an…
Information decompositions quantify how the Shannon information about a given random variable is distributed among several other random variables. Various requirements have been proposed that such a decomposition should satisfy, leading to…
We consider different choice procedures such as scoring rules, rules, using majority relation, value function and tournament matrix, which are used in social and multi-criteria choice problems. We focus on the study of the properties that…
Given two combinatorial identities proved earlier, a new set of variations of these combinatorial identities is listed and proved with the integral representation method. Some identities from literature are shown to be special cases of…
We introduce contracts for linear dynamical systems with inputs and outputs. Contracts are used to express formal specifications on the dynamic behaviour of such systems through two aspects: assumptions and guarantees. The assumptions are a…
In the article the necessary and sufficient conditions for a representation of Lipschitz function of two variables as a difference of two convex functions are formulated. An algorithm of this representation is given. The outcome of this…
The binary relation framework has been shown to be applicable to many real-life preference handling scenarios. Here we study preference contraction: the problem of discarding selected preferences. We argue that the property of minimality…
This article defines a complement of a function and conditions for existence of such a complement function and presents few algorithms to construct a complement.