相关论文: Recognizing Linked Domain in Polynomial Time
A most debated topic of the last years is whether simple statistical physics models can explain collective features of social dynamics. A necessary step in this line of endeavour is to find regularities in data referring to large scale…
After Gentili and Struppa introduced in 2006 the theory of quaternionic slice regular function, the theory has focused on functions on the so-called slice domains. The present work defines the class of speared domains, which is a rather…
Chatterjee's rank correlation is a directed measure of association designed to detect whether one variable can be predicted as a function of another. While the original coefficient is naturally defined for real-valued data, circular data…
This paper contains an extensive combinatorial analysis of the single-peaked domain restriction and investigates the likelihood that an election is single-peaked. We provide a very general upper bound result for domain restrictions that can…
We consider an extension of linear-time temporal logic (LTL) with both local and remote data constraints interpreted over a concrete domain. This extension is a natural extension of constraint LTL and the Temporal Logic of Repeating Values,…
Social choice theory is the study of preference aggregation across a population, used both in mechanism design for human agents and in the democratic alignment of language models. In this study, we propose the representative social choice…
We formulate and prove a very general relative version of the Dobrushin-Lanford-Ruelle theorem which gives conditions on constraints of configuration spaces over a finite alphabet such that for every absolutely summable relative…
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…
Social choice is replete with various settings including single-winner voting, multi-winner voting, probabilistic voting, multiple referenda, and public decision making. We study a general model of social choice called Sub-Committee Voting…
Voting is the aggregation of individual preferences in order to select a winning alternative. Selection of a winner is accomplished via a voting rule, e.g., rank-order voting, majority rule, plurality rule, approval voting. Which voting…
An ordinal preference domain is a subset of preference orders that the voters are allowed to cast in an election. We introduce and study the notion of outer diversity of a domain and evaluate its value for a number of well-known structured…
Social choice theory is a theoretical framework for analysis of combining individual preferences, interests, or welfare to reach a collective decision or social welfare in some sense. We introduce a new criterion for social choice protocols…
A plethora of natural, artificial and social systems exist which do not belong to the Boltzmann-Gibbs (BG) statistical-mechanical world, based on the standard additive entropy $S_{BG}$ and its associated exponential BG factor. Frequent…
The integrity of elections is central to democratic systems. However, a myriad of malicious actors aspire to influence election outcomes for financial or political benefit. A common means to such ends is by manipulating perceptions of the…
A projective quantum logic in terms of relative states is developed, emphasizing the importance of information transfer between a system under study and its environment. The need for accounting for the historical evolution of system is…
We show how voting may be viewed naturally from an algebraic perspective by viewing voting profiles as elements of certain well-studied $\mathbb{Q}S_n$-modules. By using only a handful of simple combinatorial objects (e.g., tabloids) and…
The Possible-Winner problem asks, given an election where the voters' preferences over the set of candidates is partially specified, whether a distinguished candidate can become a winner. In this work, we consider the computational…
We prove explicitly that to every discrete, semibounded Hamiltonian with constant degeneracy and with finite sum of the squares of the reciprocal of its eigenvalues and whose eigenvectors span the entire Hilbert space there exists a…
In this paper we address the decision problem for a fragment of set theory with restricted quantification which extends the language studied in [4] with pair related quantifiers and constructs, in view of possible applications in the field…
The major finding, of this article, is an ensemble method, but more exactly, a novel, better ranked voting system (and other variations of it), that aims to solve the problem of finding the best candidate to represent the voters. We have…