RANKING OF CANDIDATES IN VOTING SYSTEMS BASED ON VIRTUAL CANDIDATES
Publish place: 4th Conference on Data Envelopment Analysis
Publish Year: 1391
Type: Conference paper
Language: English
View: 1,154
متن کامل این Paper منتشر نشده است و فقط به صورت چکیده یا چکیده مبسوط در پایگاه موجود می باشد.
توضیح: معمولا کلیه مقالاتی که کمتر از ۵ صفحه باشند در پایگاه سیویلیکا اصل Paper (فول تکست) محسوب نمی شوند و فقط کاربران عضو بدون کسر اعتبار می توانند فایل آنها را دانلود نمایند.
- Certificate
- I'm the author of the paper
Export:
Document National Code:
DEA04_031
Index date: 30 April 2013
RANKING OF CANDIDATES IN VOTING SYSTEMS BASED ON VIRTUAL CANDIDATES abstract
A key issue in the preferential voting framework is how voters express their preferences on a set of candidates. There are different methods to allow the voters to state their preferences on a set of candidates. The main drawback of such scoring rules is that they assume the votes of all voters have equal importance and there is no preference among them. To the best of our knowledge, till now there is no method to obtain the preference score of candidates in which there exist a priority among voters. Then we introduce two models to measure the best preference scores of the target candidate from the virtual best candidate and the virtual worst candidate point of view. Finally, we aggregate the two preference scores together for an overall ranking.
RANKING OF CANDIDATES IN VOTING SYSTEMS BASED ON VIRTUAL CANDIDATES Keywords:
RANKING OF CANDIDATES IN VOTING SYSTEMS BASED ON VIRTUAL CANDIDATES authors
Ali Ebrahimnejad
Department of Mathematics, Qaemshahr Branch, Islamic Azad University, Qaemshahr, Iran