English
Related papers

Related papers: Separable joint choices

200 papers

Differential privacy is a precise mathematical constraint meant to ensure privacy of individual pieces of information in a database even while queries are being answered about the aggregate. Intuitively, one must come to terms with what…

Information Theory · Computer Science 2016-08-15 Paul Cuff , Lanqing Yu

We show how the separability problem is dual to that of decomposing any given matrix into a conic combination of rank-one partial isometries, thus offering a duality approach different to the positive maps characterization problem. Several…

Quantum Physics · Physics 2007-05-23 D. Salgado , J. L. Sanchez-Gomez , M. Ferrero

In previous work cite{Ha98:Towards} we presented a case-based approach to eliciting and reasoning with preferences. A key issue in this approach is the definition of similarity between user preferences. We introduced the probabilistic…

Artificial Intelligence · Computer Science 2013-01-14 Vu A. Ha , Peter Haddawy , John Miyamoto

A central paradigm behind process semantics based on observability and testing is that the exact moment of occurring of an internal nondeterministic choice is unobservable. It is natural, therefore, for this property to hold when the…

Logic in Computer Science · Computer Science 2009-07-10 Sonja Georgievska , Suzana Andova

The fact that there are quantum observables without a simultaneous measurement is one of the fundamental characteristics of quantum mechanics. In this work we expand the concept of joint measurability to all kinds of possible measurement…

Quantum Physics · Physics 2014-02-19 Teiko Heinosaari , Takayuki Miyadera , Daniel Reitzner

Recovering and distinguishing between the strict-preference, indifference and/or indecisiveness parts of a decision maker's preferences is a challenging task but also important for testing theory and conducting welfare analysis. This paper…

Theoretical Economics · Economics 2025-09-15 Georgios Gerasimou

The study of rational relations is fundamental to the study of formal languages and automata theory. A rational relation is conjugate if each pair of words in the relation is conjugate (or cyclic shifts of each other). The notion of…

Formal Languages and Automata Theory · Computer Science 2024-02-16 C. Aiswarya , Amaldev Manuel , Saina Sunny

The assumption of separability is a simplifying and very popular assumption in the analysis of spatio-temporal or hypersurface data structures. It is often made in situations where the covariance structure cannot be easily estimated, for…

Methodology · Statistics 2019-01-03 Pramita Bagchi , Holger Dette

Choice consistency with utility maximization, as a key assumption in economics, has been extensively used to evaluate decision quality of individuals and to predict real-world outcomes across different contexts. Here we investigate the…

General Economics · Economics 2025-09-22 Mingshi Chen , Tracy Xiao Liu , You Shan , Shu Wang , Songfa Zhong , Yanju Zhou

While several classes of integer linear optimization problems are known to be solvable in polynomial time, far fewer tractability results exist for integer nonlinear optimization. In this work, we narrow this gap by identifying a broad…

Optimization and Control · Mathematics 2026-02-09 Alberto Del Pia

This paper introduces the new concepts of Functional Controllability and Functional Stabilizability, and establishes their duality with Functional Observability and Functional Detectability, respectively. A Generalized Separation Principle…

Systems and Control · Electrical Eng. & Systems 2026-02-18 Tyrone Fernando , Mohamed Darouach

It is known that, in finite dimensions, the support function of a compact convex set with non empty interior is differentiable excepting the origin if and only if the set is strictly convex. In this paper we realize a thorough study of the…

Functional Analysis · Mathematics 2013-01-07 C. Zalinescu

Unimodularity is localized to a complete stationary type, and its properties are analysed. Some variants of unimodularity for definable and type-definable sets are introduced, and the relationship between these different notions is studied.…

Logic · Mathematics 2016-10-06 Darío García , Frank Olaf Wagner

Verification of discrete time or continuous time dynamical systems over the reals is known to be undecidable. It is however known that undecidability does not hold for various classes of systems: if robustness is defined as the fact that…

Computational Complexity · Computer Science 2024-02-08 Manon Blanc , Olivier Bournez

Distinguishability and, by extension, observability are key properties of dynamical systems. Establishing these properties is challenging, especially when no analytical model is available and they are to be inferred directly from…

Systems and Control · Electrical Eng. & Systems 2024-06-10 Pierre-François Massiani , Mona Buisson-Fenet , Friedrich Solowjow , Florent Di Meglio , Sebastian Trimpe

Many techniques in computer vision, machine learning, and statistics rely on the fact that a signal of interest admits a sparse representation over some dictionary. Dictionaries are either available analytically, or can be learned from a…

Computer Vision and Pattern Recognition · Computer Science 2013-03-22 Simon Hawe , Matthias Seibert , Martin Kleinsteuber

In this letter we investigate the possibility of observing macroscopic entanglement, considering realistic factors such as decoherence, particle losses, and measurements of limited precision (coarse-grained collective measurements). This…

Quantum Physics · Physics 2025-02-24 Martina Gisti , Miguel Gallego , Borivoje Dakić

Several concepts on the measure of observability, reachability, and robustness are defined and illustrated for both linear and nonlinear control systems. Defined by using computational dynamic optimization, these concepts are applicable to…

Optimization and Control · Mathematics 2009-07-17 Wei Kang , Liang Xu

A preference matrix $M$ has an entry for each pair of candidates in an election whose value $p_{ij}$ represents the proportion of voters that prefer candidate $i$ over candidate $j$. The matrix is rationalizable if it is consistent with a…

Discrete Mathematics · Computer Science 2024-06-03 Agnes Totschnig , Rohit Vasishta , Adrian Vetta

For readers already familiar with Partial Information Decomposition (PID), we show that PID's definition of synergy enables quantifying at least four different notions of irreducibility. First, we show four common notions of "parts" give…

Information Theory · Computer Science 2013-12-13 Virgil Griffith , Jonathan Harel