6,153 research outputs found
Monotone Preferences over Information
We consider preference relations over information that are monotone: more information is preferred to less. We prove that, if a preference relation on information about an uncountable set of states of nature is monotone, then it is not representable by a utility function
Monotone Preferences over Information
We consider preference relations over information that are monotone: more information is preferred to less. We prove that, if a preference relation on information about an uncountable set of states of nature is monotone, then it is not representable by a utility function.Value of information, Blackwell's theorem, representation theorems, monotone preferences
On Petersson's partition limit formula
For each prime consider the Legendre character . Let be the number of partitions of into parts such that . Petersson proved a beautiful limit formula for the ratio of to as expressed in terms of important invariants of the real quadratic field . But his proof is not illuminating and Grosswald conjectured a more natural proof using a Tauberian converse of the Stolz-Ces\`aro theorem. In this paper we suggest an approach to address Grosswald's conjecture. We discuss a monotonicity conjecture which looks quite natural in the context of the monotonicity theorems of Bateman-Erd\H{o}s
Recommended from our members
On defining partition entropy by inequalities
Partition entropy is the numerical metric of uncertainty within
a partition of a finite set, while conditional entropy measures the degree of
difficulty in predicting a decision partition when a condition partition is
provided. Since two direct methods exist for defining conditional entropy
based on its partition entropy, the inequality postulates of monotonicity,
which conditional entropy satisfies, are actually additional constraints on
its entropy. Thus, in this paper partition entropy is defined as a function
of probability distribution, satisfying all the inequalities of not only partition
entropy itself but also its conditional counterpart. These inequality
postulates formalize the intuitive understandings of uncertainty contained
in partitions of finite sets.We study the relationships between these inequalities,
and reduce the redundancies among them. According to two different
definitions of conditional entropy from its partition entropy, the convenient
and unified checking conditions for any partition entropy are presented, respectively.
These properties generalize and illuminate the common nature
of all partition entropies
Optimal partitioning of an interval and applications to Sturm-Liouville eigenvalues
We study the optimal partitioning of a (possibly unbounded) interval of the
real line into subintervals in order to minimize the maximum of certain
set-functions, under rather general assumptions such as continuity,
monotonicity, and a Radon-Nikodym property. We prove existence and uniqueness
of a solution to this minimax partition problem, showing that the values of the
set-functions on the intervals of any optimal partition must coincide. We also
investigate the asymptotic distribution of the optimal partitions as tends
to infinity. Several examples of set-functions fit in this framework, including
measures, weighted distances and eigenvalues. We recover, in particular, some
classical results of Sturm-Liouville theory: the asymptotic distribution of the
zeros of the eigenfunctions, the asymptotics of the eigenvalues, and the
celebrated Weyl law on the asymptotics of the counting function
On the structure of phase transition maps for three or more coexisting phases
This paper is partly based on a lecture delivered by the author at the ERC
workshop "Geometric Partial Differential Equations" held in Pisa in September
2012. What is presented here is an expanded version of that lecture.Comment: 23 pages, 6 figure
- …