Related papers: Cubic Preferences and the Character Admissibility …
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…
We present an extension-based approach for computing and verifying preferences in an abstract argumentation system. Although numerous argumentation semantics have been developed previously for identifying acceptable sets of arguments from…
For multidimensional Euclidean type spaces, we study convex choice: from any choice set, the set of types that make the same choice is convex. We establish that, in a suitable sense, this property characterizes the sufficiency of local…
The paper deals with partial and weak preference relations defined on infinite-dimensional vector spaces and compatible with algebraic operations. By a partial preference we mean an asymmetric and transitive binary relation, while a weak…
The purpose of this article is to show that even the most elementary problems in asymptotic extremal graph theory can be highly non-trivial. We study linear inequalities between graph homomorphism densities. In the language of quantum…
Different voters behave differently, different governments make different decisions, or different organizations are ruled differently. Many research questions important to political scientists concern choice behavior, which involves dealing…
We give a necessary and sufficient condition for a cubic graph to be Hamiltonian by analyzing Eulerian tours in certain spanning subgraphs of the quartic graph associated with the cubic graph by 1-factor contraction. This correspondence is…
Development of conceptual multiple-choice tests related to a particular physics topic is important for designing research-based learning tools to reduce the difficulties. We explore the difficulties that the advanced undergraduate and…
Heuristic functions are central to the performance of search algorithms such as A-star, where admissibility - the property of never overestimating the true shortest-path cost - guarantees solution optimality. Recent deep learning approaches…
Understanding citizens' values in participatory systems is crucial for citizen-centric policy-making. We envision a hybrid participatory system where participants make choices and provide motivations for those choices, and AI agents…
We study some problems of collective choice when individuals can have expressive preferences, that is, where a decision-maker may care not only about the material benefit from choosing an action but also about some intrinsic morality of the…
Mechanism design is concerned with settings where a policymaker (or social planner) faces the problem of aggregating the announced preferences of multiple agents into a collective (or social), system-wide decision. One of the most important…
Computational Social Choice is an interdisciplinary research area involving Economics, Political Science, and Social Science on the one side, and Mathematics and Computer Science (including Artificial Intelligence and Multiagent Systems) on…
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…
We give a separability criterion for three qubit states in terms of diagonal and anti-diagonal entries. This gives us a complete characterization of separability when all the entries are zero except for diagonal and anti-diagonals. The…
This paper contributes to interpretable machine learning via visual knowledge discovery in parallel coordinates. The concepts of hypercubes and hyper-blocks are used as easily understandable by end-users in the visual form in parallel…
A general scheme for determining and studying integrable deformations of algebraic curves is presented. The method is illustrated with the analysis of the hyperelliptic case. An associated multi-Hamiltonian hierarchy of systems of…
Cubic invariants for two-dimensional Hamiltonian systems are investigated using the Jacobi geometrization procedure. This approach allows for a unified treatment of invariants at both fixed and arbitrary energy. In the geometric picture the…
The set of answers to a query may be very large, potentially overwhelming users when presented with the entire set. In such cases, presenting only a small subset of the answers to the user may be preferable. A natural requirement for this…
We study single-candidate voting embedded in a metric space, where both voters and candidates are points in the space, and the distances between voters and candidates specify the voters' preferences over candidates. In the voting, each…