Related papers: Separable joint choices
The concept of decomposition in computer science and engineering is considered a fundamental component of computational thinking and is prevalent in design of algorithms, software construction, hardware design, and more. We propose a simple…
The intractability of any problem and the randomness of its solutions have an obvious intuitive connection. However, the challenge till now has been that there is no practical way to firmly establish if the solution to a problem is actually…
Recently, symbolic structures were proposed as finite representations of potentially infinite first-order structures, where Linear Integer Arithmetic terms and formulas define the domain and interpretations of a structure. We generalize…
Consumer heterogeneity in revealed-preference data is larger than bilateral rationality tests can reveal. We construct a continuous nonparametric metric of this hidden heterogeneity by repeatedly subsampling choices, partitioning consumers…
A dynamical network, a graph whose nodes are dynamical systems, is usually characterized by a large dimensional space which is not always accesible due to the impossibility of measuring all the variables spanning the state space. Therefore,…
Among the various forms of reasoning studied in the context of artificial intelligence, qualitative reasoning makes it possible to infer new knowledge in the context of imprecise, incomplete information without numerical values. In this…
Reproducibility is a confused terminology. In this paper, I take a fundamental view on reproducibility rooted in the scientific method. The scientific method is analysed and characterised in order to develop the terminology required to…
Pairwise comparisons between alternatives are a well-established tool to decompose decision problems into smaller and more easily tractable sub-problems. However, due to our limited rationality, the subjective preferences expressed by…
We present a method for calculating and analyzing stakeholder utilities of processes that arise in, but are not limited to, the social sciences. These areas include business process analysis, healthcare workflow analysis and policy process…
We study the setting of committee elections, where a group of individuals needs to collectively select a given size subset of available objects. This model is relevant for a number of real-life scenarios including political elections,…
Researchers develop models to explain the unknowns. These models typically involve parameters that capture tangible quantities, the estimation of which is desired. Parameter identifiability investigates the recoverability of the unknown…
We propose and develop an algebraic approach to revealed preference. Our approach dispenses with non algebraic structure, such as topological assumptions. We provide algebraic axioms of revealed preference that subsume previous, classical…
In this paper, we give out some effective criterions which can be used to judge the separability of multipartite pure states. We obtain the relationship between separability and Schmidt decomposable of multipartite pure states in Theorem1.…
An analysis of high-dimensional data can offer a detailed description of a system but is often challenged by the curse of dimensionality. General dimensionality reduction techniques can alleviate such difficulty by extracting a few…
The search for new integrable (3+1)-dimensional partial differential systems is among the most important challenges in the modern integrability theory. It turns out that such a system can be associated to any pair of rational functions of…
This research seeks to benefit the software engineering society by proposing comparative separation, a novel group fairness notion to evaluate the fairness of machine learning software on comparative judgment test data. Fairness issues have…
At the beginning of a dynamic game, players may have exogenous theories about how the opponents are going to play. Suppose that these theories are commonly known. Then, players will refine their first-order beliefs, and challenge their own…
In this article, we investigate the arithmetical hierarchy from the perspective of realizability theory. An experimental observation in classical computability theory is that the notion of degrees of unsolvability for natural arithmetical…
The problem of non-iterative one-shot and non-destructive correction of unavoidable mistakes arises in all Artificial Intelligence applications in the real world. Its solution requires robust separation of samples with errors from samples…
Using new results on the separability properties of bosonic systems, we provide a new complete criterion for separability. This criterion aims at characterizing the set of separable states from the inside by means of a sequence of…