Related papers: Lexicographic choice functions
We show that positively $1$--homogeneous rank one convex functions are convex at $0$ and at matrices of rank one. The result is a special case of an abstract convexity result that we establish for positively $1$--homogeneous directionally…
For a broad class of models widely used in practice for choice and ranking data based on Luce's choice axiom, including the Bradley--Terry--Luce and Plackett--Luce models, we show that the associated maximum likelihood estimation problems…
Envy-freeness up to any good (EFX) provides a strong and intuitive guarantee of fairness in the allocation of indivisible goods. But whether such allocations always exist or whether they can be efficiently computed remains an important open…
It is shown that the convex order between the distributions of linear functionals does not imply the convex order between the probability distributions over $\mathbb R^d$ if $d\ge2$. This stands in contrast with the well-known fact that any…
The objective of this paper is to investigate the connection between penalty functions from stochastic optimal control, convex semigroups from analysis and convex expectations from probability theory. Our main result provides a one-to-one…
Geometrically convex functions constitute an interesting class of functions obtained by replacing the arithmetic mean with the geometric mean in the definition of convexity. As recently suggested, geometric convexity may be a sensible…
This note deals with certain properties of convex functions. We provide results on the convexity of the set of minima of these functions, the behaviour of their subgradient set under restriction, and optimization of these functions over an…
The theoretical computing of special values assumed by the hypergeometric functions has a high interest not only on its own, but also in sight of the remarkable implications to both pure Mathematics and Mathematical Physics. Accordingly, in…
We combine several folklore observations to provide a working framework for iterating constructions which contradict the axiom of choice. We use this to define a model in which any kind of structural failure must fail with a proper class of…
Submodular Functions are a special class of set functions, which generalize several information-theoretic quantities such as entropy and mutual information [1]. Submodular functions have subgradients and subdifferentials [2] and admit…
We define notions of cautiousness and cautious belief to provide epistemic conditions for iterated admissibility in finite games. We show that iterated admissibility characterizes the behavioral implications of "cautious rationality and…
We study the computational power of randomized computations on infinite objects, such as real numbers. In particular, we introduce the concept of a Las Vegas computable multi-valued function, which is a function that can be computed on a…
We show a general phenomenon of the constrained functional value for densities satisfying general convexity conditions, which generalizes the observation in Bobkov and Madiman (2011) that the entropy per coordinate in a log-concave random…
This work proposes a view of probability as a relative measure rather than an absolute one. To demonstrate this concept, we focus on finite outcome spaces and develop three fundamental axioms that establish requirements for relative…
We treat uncertain linear programming problems by utilizing the notion of weighted analytic centers and notions from the area of multi-criteria decision making. After introducing our approach, we develop interactive cutting-plane algorithms…
In this manuscript, we define and study probabilistic values for cooperative games on simplicial complexes. Inspired by the work of Weber "Probabilistic values for games", we establish the new theory step by step, following the classical…
Temporal abstraction refers to the ability of an agent to use behaviours of controllers which act for a limited, variable amount of time. The options framework describes such behaviours as consisting of a subset of states in which they can…
The logarithmic convexity of restrictions of the Beta functions to rays parallel to the main diagonal and the functional equation \[ \phi\left( x+1\right) =\frac{x\left( x+k\right) }{\left( 2x+k+1\right) \left( 2x+k\right) }\phi\left(…
We provide foundations for decisions in face of unlikely events by extending the standard framework of Savage to include preferences indexed by a family of events. We derive a subjective lexicographic expected utility representation which…
In the paper we study choice functions on posets satisfying the conditions of heredity and outcast. For every well-ordered sequence of elements of poset, we define the corresponding `elementary' choice function. Every such a choice function…