English
Related papers

Related papers: Single-crossing dominance: A preference lattice

200 papers

A definition of structural diversity, adapted from the biodiversity literature, is introduced to provide a general characterization of structures of condensed matter. Using the Favored Local Structure (FLS) lattice model as a testbed, the…

Materials Science · Physics 2024-08-16 Yueran Wang , Peter Harrowell

We present a simple proof of a well-known axiomatic characterization of state-salient decision rules, using Weak Dominance Criterion and Global Independence of Irrelevant Alternatives. Subsequently we provide a simple axiomatic…

Optimization and Control · Mathematics 2025-03-11 Somdeb Lahiri

A preference system $\mathcal{I}$ is an undirected graph where vertices have preferences over their neighbors, and $\mathcal{I}$ admits a master list if all preferences can be derived from a single ordering over all vertices. We study the…

Computational Complexity · Computer Science 2022-12-13 Ildikó Schlotter

Super-stability and strong stability are properties of a matching in the stable matching problem with ties. In this paper, we introduce a common generalization of super-stability and strong stability, which we call non-uniform stability.…

Computer Science and Game Theory · Computer Science 2024-08-30 Naoyuki Kamiyama

We explore a simple lattice field model intended to describe statistical properties of high frequency financial markets. The model is relevant in the cross-disciplinary area of econophysics. Its signature feature is the emergence of a…

Computational Finance · Quantitative Finance 2015-05-20 B. Dupoyet , H. R. Fiebig , D. P. Musgrove

The topologies permitted in joint ocular dominance (OD), orientation preference (OP), and direction preference (DP) maps in the primary visual cortex (V1) are considered, with the aim of finding a maximally symmetric periodic case that can…

Biological Physics · Physics 2021-12-14 X. Liu , P. A. Robinson

In a capacitated directed graph, it is known that the set of all min-cuts forms a distributive lattice [1], [2]. Here, we describe this lattice as a regular predicate whose forbidden elements can be advanced in constant parallel time after…

Data Structures and Algorithms · Computer Science 2025-12-23 Robert Streit , Vijay K. Garg

We study correlations in temporal networks and introduce the notion of betweenness preference. It allows to quantify to what extent paths, existing in time-aggregated representations of temporal networks, are actually realizable based on…

Physics and Society · Physics 2015-03-20 René Pfitzner , Ingo Scholtes , Antonios Garas , Claudio J. Tessone , Frank Schweitzer

In applications such as recommendation systems and revenue management, it is important to predict preferences on items that have not been seen by a user or predict outcomes of comparisons among those that have never been compared. A popular…

Machine Learning · Computer Science 2015-06-29 Sewoong Oh , Kiran K. Thekumparampil , Jiaming Xu

We define and study structural properties of hypergraphs of models of a theory including lattice ones. Characterizations for the lattice properties of hypergraphs of models of a theory, as well as for structures on sets of isomorphism types…

Logic · Mathematics 2018-02-28 Beibut Kulpeshov , Sergey Sudoplatov

We introduce and study the property of orthogonal independence, a restricted additivity axiom applying when alternatives are orthogonal. The axiom requires that the preference for one marginal change over another should be maintained after…

Theoretical Economics · Economics 2020-02-14 Christopher P. Chambers , Federico Echenique

In a many-to-one matching model in which firms' preferences satisfy substitutability, we study the set of worker-quasi-stable matchings. Worker-quasi-stability is a relaxation of stability that allows blocking pairs involving a firm and an…

Theoretical Economics · Economics 2022-03-04 Agustin G. Bonifacio , Nadia Guinazu , Noelia Juarez , Pablo Neme , Jorge Oviedo

Several of the classical results in social choice theory demonstrate that in order for many voting systems to be well-behaved the set domain of individual preferences must satisfy some kind of restriction, such as being single-peaked on a…

Theoretical Economics · Economics 2024-01-23 Alexander Karpov , Klas Markström , Søren Riis , Bei Zhou

Recently, self-supervised contrastive learning has achieved great success on various tasks. However, its underlying working mechanism is yet unclear. In this paper, we first provide the tightest bounds based on the widely adopted assumption…

Machine Learning · Computer Science 2025-11-06 Qi Zhang , Yifei Wang , Yisen Wang

We study mechanism which operate on ordinal preference information (i.e., rank ordered lists of alternatives) on the full domain of weak preferences that admits indifferences. We present a novel decomposition of strategyproofness into three…

Computer Science and Game Theory · Computer Science 2020-07-15 Timo Mennle , Sven Seuken

We prove some general theorems for preserving Dependent Choice when taking symmetric extensions, some of which are unwritten folklore results. We apply these to various constructions to obtain various simple consistency proofs.

Logic · Mathematics 2019-05-10 Asaf Karagila

In an earlier paper, to describe how a congruence spreads from a prime interval to another in a finite lattice, I introduced the concept of prime-perspectivity and its transitive extension, prime-projectivity and proved the…

Rings and Algebras · Mathematics 2015-04-27 George Grätzer

A two-dimensional lattice model with bond disorder is used to investigate the fracture behaviour under stress-controlled conditions. Although the cumulative energy of precursors does not diverge at the critical point, its derivative with…

Materials Science · Physics 2007-05-23 G. Meacci , A. Politi , M. Zei

High-dimensional systems that have a low-dimensional dominant behavior allow for model reduction and simplified analysis. We use differential analysis to formalize this important concept in a nonlinear setting. We show that dominance can be…

Systems and Control · Computer Science 2018-08-08 Fulvio Forni , Rodolphe Sepulchre

Pairwise comparison matrices often exhibit inconsistency, therefore many indices have been suggested to measure their deviation from a consistent matrix. A set of axioms has been proposed recently that is required to be satisfied by any…

Artificial Intelligence · Computer Science 2020-05-28 László Csató
‹ Prev 1 8 9 10 Next ›