English
Related papers

Related papers: Expected utility theory on mixture spaces without …

200 papers

In a consideration set model, an individual maximizes utility among the considered alternatives. I relate a consideration set additive random utility model to classic discrete choice and the extended additive random utility model, in which…

Econometrics · Economics 2024-05-24 Roy Allen

We exhibit an adjunction between a category of abstract algebras of partial functions and a category of set quotients. The algebras are those atomic algebras representable as a collection of partial functions closed under relative…

Logic · Mathematics 2022-06-15 Célia Borlido , Brett McLean

Magnitude is an isometric invariant of metric spaces introduced by Leinster. Since its inception, it has inspired active research into its connections with integral geometry, geometric measure theory, fractal dimensions, persistent…

General Topology · Mathematics 2026-05-21 Sara Kališnik , Davorin Lešnik

We prove that a rank one transformation satisfying a condition called restricted growth is a mixing transformation if and only if the spacer sequence for the transformation is uniformly ergodic. Uniform ergodicity is a generalization of the…

Dynamical Systems · Mathematics 2007-05-23 Darren Creutz , C. E. Silva

A partitioned process theory, as defined by Coecke, Fritz, and Spekkens, is a symmetric monoidal category together with an all-object-including symmetric monoidal subcategory. We think of the morphisms of this category as processes, and the…

Logic in Computer Science · Computer Science 2015-11-06 Brendan Fong , Hugo Nava-Kopp

This is a survey and research note on the modified Orlik conjecture derived from the division theorem introduced in [2]. The division theorem is a generalization of classical addition-deletion theorems for free arrangements. The division…

Commutative Algebra · Mathematics 2016-03-15 Takuro Abe

We say that a set is exhaustible if it admits algorithmic universal quantification for continuous predicates in finite time, and searchable if there is an algorithm that, given any continuous predicate, either selects an element for which…

Logic in Computer Science · Computer Science 2015-07-01 Martin Escardo

Let $T$ be a compact, metrisable and strongly countable-dimensional topological space. Let $\mathcal{M}^T$ be the set of all metrics $d$ on $T$ compatible with its topology, and equip $\mathcal{M}^T$ with the topology of uniform…

Functional Analysis · Mathematics 2024-05-31 Filip Talimdjioski

Nonuniformity is a central concept in computational complexity with powerful connections to circuit complexity and randomness. Nonuniform reductions have been used to study the isomorphism conjecture for NP and completeness for larger…

Computational Complexity · Computer Science 2018-01-19 John M. Hitchcock , Hadi Shafei

Mixtures of truncated exponentials (MTE) potentials are an alternative to discretization for representing continuous chance variables in influence diagrams. Also, MTE potentials can be used to approximate utility functions. This paper…

Artificial Intelligence · Computer Science 2012-07-19 Barry Cobb , Prakash P. Shenoy

The simultaneous growth of multiple microbial species is a problem of fundamental ecological interest. In media containing more than one growth-limiting substrate, multiple species can coexist. The question then arises: Can single-species…

Populations and Evolution · Quantitative Biology 2007-05-23 Atul Narang , Sergei S. Pilyugin

Although mixed extensions of finite games always admit equilibria, this is not the case for countable games, the best-known example being Wald's pick-the-larger-integer game. Several authors have provided conditions for the existence of…

Computer Science and Game Theory · Computer Science 2017-04-04 Valerio Capraro , Marco Scarsini

Scheduling jobs with precedence constraints on a set of identical machines to minimize the total processing time (makespan) is a fundamental problem in combinatorial optimization. In practical settings such as cloud computing, jobs are…

Data Structures and Algorithms · Computer Science 2014-04-29 Konstantin Makarychev , Debmalya Panigrahi

For different classes of measure preserving transformations, we investigate collections of sets that exhibit the property of lightly mixing. Lightly mixing is a stronger property than topological mixing, and requires that a lim inf is…

Dynamical Systems · Mathematics 2016-04-06 Terrence M. Adams

A central topic in mathematical logic is the classification of theorems from mathematics in hierarchies according to their logical strength. Ideally, the place of a theorem in a hierarchy does not depend on the representation (aka coding)…

Logic · Mathematics 2025-02-05 Sam Sanders

We characterize order preserving continuous surjections between compact linearly ordered spaces which admit an averaging operator, together with estimates of the norm of such an operator. This result is used to the study of strengthenings…

Functional Analysis · Mathematics 2012-10-23 Wieslaw Kubiś , Ondrej Kalenda

Mixed-monotone systems are separable via a decomposition function into increasing and decreasing components, and this decomposition function allows for embedding the system dynamics in a higher-order monotone embedding system. Embedding the…

Systems and Control · Electrical Eng. & Systems 2021-03-22 Matthew Abate , Samuel Coogan

Using the theory of Hilbert direct integrals, we introduce and study a monotonicity-preserving operation, termed the integral resolvent mixture. It combines arbitrary families of monotone operators acting on different spaces and linear…

Optimization and Control · Mathematics 2024-08-13 Minh N. Bùi , Patrick L. Combettes

Order statistics theory is applied in this paper to probabilistic robust control theory to compute the minimum sample size needed to come up with a reliable estimate of an uncertain quantity under continuity assumption of the related…

Optimization and Control · Mathematics 2008-05-13 Xinjia Chen , Kemin Zhou

Many results on the convex order in the literature were stated for random variables with finite mean. For instance, a fundamental result in dependence modeling is that the sum of a pair of random random variables is upper bounded in convex…

Probability · Mathematics 2026-02-27 Benjamin Côté , Ruodu Wang