相关论文: Constructing the demand function of a strictly con…
We present a necessary and sufficient condition for the topological equivalence of a continuous function on a plane to a projection onto one of coordinates.
We consider composite loss functions for multiclass prediction comprising a proper (i.e., Fisher-consistent) loss over probability distributions and an inverse link function. We establish conditions for their (strong) convexity and explore…
In this paper, we study the problem of constructing a network by observing ordered connectivity constraints, which we define herein. These ordered constraints are made to capture realistic properties of real-world problems that are not…
It is well known that functions (resp. operators) satisfying a property~$p$ on a subset $Q\subset \mathbb{R}^d$ cannot necessarily be extended to a function (resp. operator) satisfying~$p$ on the whole of~$\mathbb{R}^d$. Given $Q \subseteq…
For a many-to-one matching market where firms have strict and $\boldsymbol{q}$-responsive preferences, we give a characterization of the set of strongly stable fractional matchings as the union of the convex hull of all connected sets of…
The paper studies complementary choice functions, i.e. monotonic and consistent choice functions. Such choice functions were introduced and used in the work \cite{RY} for investigation of matchings with complementary contracts. Three…
There is a well known construction of weakly continuous valuations on convex compact polytopes in R^n. In this paper we investigate when a special case of this construction gives a valuation which extends by continuity in the Hausdorff…
We consider general subordination and obtain the formula of the subordinated predictable compensator. An example of application is given.
It is well known that the support of an optimal decomposable entanglement witness is completely entangled. We add two more necessary conditions for the optimality: The orthogonal complement of the support must have a nonzero product vector;…
We study here preference revision, considering both the monotonic case where the original preferences are preserved and the nonmonotonic case where the new preferences may override the original ones. We use a relational framework in which…
Tackling the problem of ordinal preference revelation and reasoning, we propose a novel methodology for generating an ordinal utility function from a set of qualitative preference statements. To the best of our knowledge, our proposal…
The main result presented in this article is that probability can fundamentally be characterized as a subset of conditional expectation induced by a plausible preorder on random quantities. This is justified by the fact that probability is…
The purpose of this paper is to derive some pointwise second-order necessary conditions for stochastic optimal controls in the general case that the control variable enters into both the drift and the diffusion terms. When the control…
The Collatz conjecture implies that an iterated function sequence under a certain linear operator, beginning with a certain complex valued function, must converge to a certain complex function.
Preference Inference involves inferring additional user preferences from elicited or observed preferences, based on assumptions regarding the form of the user's preference relation. In this paper we consider a situation in which…
Starting with a likelihood or preference order on worlds, we extend it to a likelihood ordering on sets of worlds in a natural way, and examine the resulting logic. Lewis earlier considered such a notion of relative likelihood in the…
Given a data-set of consumer behaviour, the Revealed Preference Graph succinctly encodes inferred relative preferences between observed outcomes as a directed graph. Not all graphs can be constructed as revealed preference graphs when the…
Necessary and sufficient conditions for finite commutative semihypergroups to be built from abelian groups of the same order are established.
In this paper, we introduce the notion of conditional $h$-convex functions and we prove an operator version of the Jensen inequality for conditional $h$-convex functions. Using this type of functions, we give some refinements for Ky-Fan's…
Assuming that the loss function is convex in the prediction, we construct a prediction strategy universal for the class of Markov prediction strategies, not necessarily continuous. Allowing randomization, we remove the requirement of…