相关论文: Exact Scale Invariance in Mixing of Binary Candida…
We introduce and study the block voter model with noise on two-dimensional square lattices using Monte Carlo simulations and finite-size scaling techniques. The model is defined by an outflow dynamics where a central set of $N_{PCS}$ spins,…
Consider an election between k candidates in which each voter votes randomly (but not necessarily independently) and suppose that there is a single candidate that every voter prefers (in the sense that each voter is more likely to vote for…
Neutral models aspire to explain biodiversity patterns in ecosystems where species difference can be neglected, as it might occur at a specific trophic level, and perfect symmetry is assumed between species. Voter-like models capture the…
In light of the classic impossibility results of Arrow and Gibbard and Satterthwaite regarding voting with ordinal rules, there has been recent interest in characterizing how well common voting rules approximate the social optimum. In order…
We study a scale invariant two measures theory where a dilaton field \phi has no explicit potentials. The scale transformations include a shift \phi\to\phi+const. The theory demonstrates a new mechanism for gene- ration of the exponential…
The dynamics of a subdiffusive continuous time random walker in an inhomogeneous environment is analyzed. In each microscopic jump, a random time is drawn from a waiting time probability density function (WT-PDF) that decays as a power law:…
We analyse two-tier voting systems with voters described by a multi-group mean-field model that allows for correlated voters both within groups as well as across group boundaries. In this model voters are influenced by voters within their…
In the United States electoral system, a candidate is elected indirectly by winning a majority of electoral votes cast by individual states, the election usually being decided by the votes cast by a small number of "swing states" where the…
In an election in which each voter ranks all of the candidates, we consider the head-to-head results between each pair of candidates and form a labeled directed graph, called the margin graph, which contains the margin of victory of each…
Bribery in election (or computational social choice in general) is an important problem that has received a considerable amount of attention. In the classic bribery problem, the briber (or attacker) bribes some voters in attempting to make…
Motivated by the difficulty of specifying complete ordinal preferences over a large set of $m$ candidates, we study voting rules that are computable by querying voters about $t < m$ candidates. Generalizing prior works that focused on…
We study the dynamics of a class of two dimensional stochastic processes, depending on two parameters, which may be interpreted as two different temperatures, respectively associated to interfacial and to bulk noise. Special lines in the…
We analyse optimal voting weights in two-tier voting systems. In our model, the overall population (or union) is split in groups (or member states) of different sizes. The individuals comprising the overall population constitute the first…
Consider the voter model on a box of side length $L$ (in the triangular lattice) with boundary votes fixed forever as type 0 or type 1 on two different halves of the boundary. Motivated by analogous questions in percolation, we study…
We establish an invariance principle for a one-dimensional random walk in a dynamical random environment given by a speed-change exclusion process. The jump probabilities of the walk depend on the configuration of the exclusion in a finite…
We consider weighted negatively reinforced urn schemes with finitely many colours. An urn scheme is called negatively reinforced, if the selection probability for a colour is proportional to the weight $w$ of the colour proportion, where…
We consider the problem of learning a target probability distribution over a set of $N$ binary variables from the knowledge of the expectation values (with this target distribution) of $M$ observables, drawn uniformly at random. The space…
Weighted voting games are frequently used in decision making. Each voter has a weight and a proposal is accepted if the weight sum of the supporting voters exceeds a quota. One line of research is the efficient computation of so-called…
The voter model is a classical interacting particle system modelling how consensus is formed across a network. We analyse the time to consensus for the voter model when the underlying graph is a subcritical scale-free random graph.…
The paper considers a general model of electoral systems combining district-based elections with a compensatory mechanism in order to create any outcome between strictly majoritarian and purely proportional seat allocation. It contains vote…