相关论文: Constructing the demand function of a strictly con…
This paper studies a robust version of the classic surplus extraction problem, in which the designer knows only that the beliefs of each type belong to some set, and designs mechanisms that are suitable for all possible beliefs in that set.…
We present a sufficient condition for the Riemann hypothesis. This condition is the existence of a special ordering on the set of finite products of distinct odd primes.
The paper suggests a new --- to the best of the author's knowledge --- characterization of decisions which are optimal in the multi-objective optimization problem with respect to a definite proper preference cone, a Euclidean cone with a…
An elaboration of Dempster's method of constructing belief functions suggests a broadly applicable strategy for constructing lower probabilities under a variety of evidentiary constraints.
In this paper, we introduce and investigate two new subclasses of analytic functions in the open unit disk in the complex plane. Several interesting properties of the functions belonging to these classes are examined. Here, sufficient, and…
It is shown that if the squeezing function tends to one at an h-extendible boundary point of a $\mathcal C^\infty$-smooth, bounded pseudoconvex domain, then the point is strictly pseudoconvex.
For multidimensional Euclidean type spaces, we study convex choice: from any choice set, the set of types that make the same choice is convex. We establish that, in a suitable sense, this property characterizes the sufficiency of local…
We advance a general theory of coherent preference that surrenders restrictions embodied in orthodox doctrine. This theory enjoys the property that any preference system admits extension to a complete system of preferences, provided it…
Let $\{S_1, S_2, \dots, S_n\}$ be an iterated function system on $\mathbb{R}$ with attractor $K$. It is known that if the iterated function system satisfies the weak separation property and $K = [0,1]$ then the iterated function system also…
If uncertainty is modelled by a probability measure, decisions are typically made by choosing the option with the highest expected utility. If an imprecise probability model is used instead, this decision rule can be generalised in several…
In this paper, we provide conditions under which one can take derivatives of the solution to convex optimization problems with respect to problem data. These conditions are (roughly) that Slater's condition holds, the functions involved are…
We give a necessary and sufficient condition for a difference of convex (DC, for short) functions, defined on a locally convex space, to be Lipschitz continuous. Our criterion relies on the intersections of the "epsilon-subdifferentials of…
By investigating the convex property of the function R, appeared in computing the entanglement of formation for isotropic states in Phys. Rev. Lett. 85, 2625 (2000), and a tight lower bound of entanglement of formation for arbitrary…
We give a sufficient condition in order that $n$ closed connected subsets in the $n$-dimensional real projective space admit a common multitangent hyperplane.
Transparency is an essential requirement of machine learning based decision making systems that are deployed in real world. Often, transparency of a given system is achieved by providing explanations of the behavior and predictions of the…
We develop refined Karush-Kuhn-Tucker (KKT) and Fritz-John (FJ)-type optimality conditions for nonsmooth, nonconvex mathematical pro\-gra\-mming problems. We pay special attention in the case that the functional constraint belongs to a…
A key idea in convex optimization theory is to use well-structured affine functions to approximate general functions, leading to impactful developments in conjugate functions and convex duality theory. This raises the question: what are the…
We construct a model of the cubic connectedness locus.
We obtain a necessary and sufficient condition under which random-coefficient discrete choice models, such as mixed-logit models, are rich enough to approximate any nonparametric random utility models arbitrarily well across choice sets.…
We systematically study the construction of mutually unbiased bases in $\mathbb{C}^{2}\bigotimes\mathbb{C}^{3}$, such that all the bases are unextendible maximally entangled ones. Necessary conditions of constructing a pair of mutually…