Paper Info
Title
The Linear Voting Model.
Abstract
We study voting models on graphs. In the beginning, the vertices of a given graph have some initial opinion. Over time, the opinions on the vertices change by interactions between graph neighbours. Under suitable conditions the system evolves to a state in which all vertices have the same opinion. In this work, we consider a new model of voting, called the Linear Voting Model. This model can be seen as a generalization of several models of voting, including among others, pull voting and push voting. One advantage of our model is that, even though it is very general, it has a rich structure making the analysis tractable. In particular we are able to solve the basic question about voting, the probability that certain opinion wins the poll, and furthermore, given appropriate conditions, we are able to bound the expected time until some opinion wins.
Year
Venue
Field
2016
ICALP
Preferential block voting,Computer science,Artificial intelligence,Bullet voting,Approval voting,Discrete mathematics,Mathematical economics,Arrow's impossibility theorem,Anti-plurality voting,Voting,Cardinal voting systems,Machine learning,Condorcet method
DocType
Citations 
PageRank 
Conference
2
0.38
References 
Authors
0
2
Name
Order
Citations
PageRank
Colin Cooper128730.73
Nicolas Rivera2278.52