Related papers: Ordering ambiguity versus representation
We note the separation of a quantum description of an experiment into a statement of results (as probabilities) and an explanation of these results (in terms of linear operators). The inverse problem of choosing an explanation to fit given…
We consider N quantum systems initially prepared in pure states and address the problem of unambiguously comparing them. One may ask whether or not all $N$ systems are in the same state. Alternatively, one may ask whether or not the states…
There are many examples in the literature that suggest that indistinguishability is intransitive, despite the fact that the indistinguishability relation is typically taken to be an equivalence relation (and thus transitive). It is shown…
Many prediction tasks contain uncertainty. In some cases, uncertainty is inherent in the task itself. In future prediction, for example, many distinct outcomes are equally valid. In other cases, uncertainty arises from the way data is…
We consider the notions of agreement, diversity, and polarization in ordinal elections (that is, in elections where voters rank the candidates). While (computational) social choice offers good measures of agreement between the voters, such…
We apply the supersymmetry approach to one-dimensional quantum systems with spatially-dependent mass, by including their ordering ambiguities dependence. In this way we extend the results recently reported in the literature. Furthermore, we…
Uncertainty quantification of complex technical systems is often based on a computer model of the system. As all models such a computer model is always wrong in the sense that it does not describe the reality perfectly. The purpose of this…
Coherence of a quantum state intrinsically depends on the choice of the reference basis. A natural question to ask is the following: if we use two or more incompatible reference bases, can~there be some trade-off relation between the…
One classical theory, as determined by an equation of motion or set of classical trajectories, can correspond to many unitarily {\em in}equivalent quantum theories upon canonical quantization. This arises from a remarkable ambiguity, not…
In allocating objects via lotteries, it is common to consider ordinal rules that rely solely on how agents rank degenerate lotteries. While ordinality is often imposed due to cognitive or informational constraints, we provide another…
Automated decision systems are increasingly used for consequential decision making -- for a variety of reasons. These systems often rely on sophisticated yet opaque models, which do not (or hardly) allow for understanding how or why a given…
Completeness and transitivity are standard rationality conditions in economics. However, under ambiguity, decision makers sometimes violate these requirements because of the difficulty of forming accurate predictions about ambiguous events.…
This paper deals with classifying ambiguities for Multimodal Languages. It evolves the classifications and the methods of the literature on ambiguities for Natural Language and Visual Language, empirically defining an original…
One of the fundamental results in computability is the existence of well-defined functions that cannot be computed. In this paper we study the effects of data representation on computability; we show that, while for each possible way of…
The aim of this work is to provide a unified framework for ordinal representations of uncertainty lying at the crosswords between possibility and probability theories. Such confidence relations between events are commonly found in monotonic…
We address the problem of characterizing $H$-coloring problems that are first-order definable on a fixed class of relational structures. In this context, we give several characterizations of a homomorphism dualities arising in a class of…
Representable implication algebras are known to be axiomatised by a finite number of equations (making the representation and finite representation problems decidable here). We show that this also holds in the context of unary (and binary)…
This paper formulates a model of utility for a continuous time framework that captures the decision-maker's concern with ambiguity about both the drift and volatility of the driving process. At a technical level, the analysis requires a…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
Finite automata with weights in the max-plus semiring are considered. The main result is: it is decidable in an effective way whether a series that is recognized by a finitely ambiguous max-plus automaton is unambiguous, or is sequential. A…