Related papers: Expected utility theory on mixture spaces without …
Preference-based many-objective optimization faces two obstacles: an expanding space of trade-offs and heterogeneous, context-dependent human value structures. Towards this, we propose a Bayesian framework that learns a small set of latent…
Hindman's celebrated Finite Sums Theorem, and its high-dimensional version due to Milliken and Taylor, are extended from covers of countable sets to covers of arbitrary topological spaces with Menger's classic covering property. The methods…
We present an adequacy theorem for a concurrent extension of probabilistic GCL. The underlying denotational semantics is based on the so-called mixed powerdomains, which combine non-determinism with probabilistic behaviour. The theorem…
We establish an equivalence between two seemingly different theories: one is the traditional axiomatisation of incomplete preferences on horse lotteries based on the mixture independence axiom; the other is the theory of desirable gambles…
Superposition is an established decision procedure for a variety of first-order logic theories represented by sets of clauses. A satisfiable theory, saturated by superposition, implicitly defines a minimal term-generated model for the…
We study countable embedding-universal and homomorphism-universal structures and unify results related to both of these notions. We show that many universal and ultrahomogeneous structures allow a concise description (called here a finite…
Dependence on the parameter is continuous when perturbations of the parameter preserves strict preference for one alternative over another. We characterise this property via a utility function over alternatives that depends continuously on…
The superposition principle lies at the heart of many non-classical properties of quantum mechanics. Motivated by this, we introduce a rigorous resource theory framework for the quantification of superposition of a finite number of linear…
We study the problem of extending an order-preserving real-valued Lipschitz map defined on a subset of a partially ordered metric space without increasing its Lipschitz constant and preserving its monotonicity. We show that a certain type…
This paper presents two general criteria to determine spaceability results in the complements of unions of subspaces. The first criterion applies to countable unions of subspaces under specific conditions and is closely related to the…
We present an abstract social aggregation theorem. Society, and each individual, has a preorder that may be interpreted as expressing values or beliefs. The preorders are allowed to violate both completeness and continuity, and the…
For a projective hyperplane arrangement, we study sufficient conditions in terms of combinatorial data for ESV-calculability of the monodromy eigenspaces of the first Milnor fiber cohomology for eigenvalues of order $m>1$. This can be…
In this paper, we study the continuity of expected utility functions, and derive a necessary and sufficient condition for a weak order on the space of simple probabilities to have a continuous expected utility function. We also verify that…
Recent results show that a constraint satisfaction problem (CSP) defined over rational numbers with their natural ordering has a solution if and only if it has a definable solution. The proof uses advanced results from topology and modern…
We say a model is continuous in utilities (resp., preferences) if small perturbations of utility functions (resp., preferences) generate small changes in the model's outputs. While similar, these two questions are different. They are only…
The set of answers to a query may be very large, potentially overwhelming users when presented with the entire set. In such cases, presenting only a small subset of the answers to the user may be preferable. A natural requirement for this…
In the setting of message passing software, De Nicola and Hennessy must-preorder defines when a program improves on another one. Since this preorder does not come equipped with a viable proof method, using it requires an alternative…
The paper introduces mixed networks, a new framework for expressing and reasoning with probabilistic and deterministic information. The framework combines belief networks with constraint networks, defining the semantics and graphical…
In [1] the authors showed some basic properties of a pre-order that arose in combinatorial number theory, namely the finite embeddability between sets of natural numbers, and they presented its generalization to ultrafilters, which is…
Order types are a well known abstraction of combinatorial properties of a point set. By Mn\"ev's universality theorem for each semi-algebraic set $V$ there is an order type with a realization space that is \emph{stably equivalent} to $V$.…