Related papers: Topological Connectedness and Behavioral Assumptio…
We study continuity and equicontinuity of semigroups on norming dual pairs with respect to topologies defined in terms of the duality. In particular, we address the question whether continuity of a semigroup already implies (local/quasi)…
In this work we introduce the idea that the primary application of topology in experimental sciences is to keep track of what can be distinguished through experimentation. This link provides understanding and justification as to why…
We critically analyze the possibility of finding signatures of a phase transition by looking exclusively at static quantities of statistical systems, like e.g., the topology of potential energy sub-manifolds (PES). This topological…
Basic pairs and their morphisms are the most elementary framework in which standard topological notions can be defined. We present here a new interpretation of topological concepts as those which can be communicated faithfully between the…
Aggregated phenomena in social sciences and economics are highly dependent on the way individuals interact. To help understanding the interplay between socio-economic activities and underlying social networks, this paper studies a…
This paper introduces a novel binary stability property for voting rules-called binary self-selectivity-by which a society considering whether to replace its voting rule using itself in pairwise elections will choose not to do so. In…
The theory of optimal choice sets is a solution theory that has a long and well-established tradition in social choice and game theories. Some of important general solution concepts of choice problems when the set of best alternatives does…
We consider a school choice matching model where the priorities for schools are represented by binary relations that may not be weak order. We focus on the (total order) extensions of the binary relations. We introduce a class of algorithms…
We study bilinear embedding models for the task of multi-relational link prediction and knowledge graph completion. Bilinear models belong to the most basic models for this task, they are comparably efficient to train and use, and they can…
Choice correspondences are crucial in decision-making, especially when faced with indifferences or ties. While tie-breaking can transform a choice correspondence into a choice function, it often introduces inefficiencies. This paper…
Exchangeability is a central notion in statistics and probability theory. The assumption that an infinite sequence of data points is exchangeable is at the core of Bayesian statistics. However, finite exchangeability as a statistical…
"Concurrence topology" (Ellis and Klein \emph{Homology, Homotopy, and Applications,} \textbf{16}) is a TDA method for binary data. The idea is to construct a filtration consisting of Dowker complexes then compute persistent homology.…
Monotonicity and recursivity are central assumptions in intertemporal consumption problems under ambiguity. We show that monotone recursive preferences admit both a recursive and an ex-ante representation, and that the certainty equivalent…
The aim of this article is to generalize logics of formal inconsistency ($\textbf{LFI}$s) to systems dealing with the concept of incompatibility, expressed by means of a binary connective. The basic idea is that having two incompatible…
We consider decision problems for relations over finite and infinite words defined by finite automata. We prove that the equivalence problem for binary deterministic rational relations over infinite words is undecidable in contrast to the…
We study the satisfiability problem for the two-variable first-order logic over structures with one transitive relation. % We show that the problem is decidable in 2-NExpTime for the fragment consisting of formulas where existential…
This paper investigates the satisfiability problem for Separation Logic, with unrestricted nesting of separating conjunctions and implications, for prenex formulae with quantifier prefix in the language $\exists^*\forall^*$, in the cases…
In the paper "Relating Strong Behavioral Equivalences for Processes with Nondeterminism and Probabilities" to appear in TCS, we present a comparison of behavioral equivalences for nondeterministic and probabilistic processes. In particular,…
Recent work has examined how undecidable problems can arise in quantum information science. We augment this by introducing three new undecidable problems stated in terms of tensor networks. These relate to ideas of Penrose about the…
The abundance of data about social relationships allows the human behavior to be analyzed as any other natural phenomenon. Here we focus on balance theory, stating that social actors tend to avoid establishing cycles with an odd number of…