Fairness and incentives in committee election
The committee election problem is to choose from a finite set of candidates a fixed size subset of committee members. The function to do so is called committee election rule. The committee election rule takes in the input of voters' preference information and produces an output of a committee....
Saved in:
Main Author: | |
---|---|
Other Authors: | |
Format: | Final Year Project |
Language: | English |
Published: |
Nanyang Technological University
2020
|
Subjects: | |
Online Access: | https://hdl.handle.net/10356/144802 |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
Institution: | Nanyang Technological University |
Language: | English |
id |
sg-ntu-dr.10356-144802 |
---|---|
record_format |
dspace |
spelling |
sg-ntu-dr.10356-1448022023-02-28T23:11:32Z Fairness and incentives in committee election Ly, Tevbot Bei Xiaohui School of Physical and Mathematical Sciences xhbei@ntu.edu.sg Science::Mathematics::Discrete mathematics The committee election problem is to choose from a finite set of candidates a fixed size subset of committee members. The function to do so is called committee election rule. The committee election rule takes in the input of voters' preference information and produces an output of a committee. We want the committee election rule to satisfy some desirable properties. Notions of fairness and strategyproofness are studied extensively in the vast majority of the literature of the sort. In general, we want the committee to be able to "fairly" represent their voters and to be strategyproof and therefore is not subject to voter manipulation. The objective of this paper is to study the existence of such election rule that satisfy these two important properties and to provide the algorithm in finding these election rules in the cases that they exist. Bachelor of Science in Mathematical Sciences and Economics 2020-11-25T02:23:56Z 2020-11-25T02:23:56Z 2020 Final Year Project (FYP) https://hdl.handle.net/10356/144802 en application/pdf Nanyang Technological University |
institution |
Nanyang Technological University |
building |
NTU Library |
continent |
Asia |
country |
Singapore Singapore |
content_provider |
NTU Library |
collection |
DR-NTU |
language |
English |
topic |
Science::Mathematics::Discrete mathematics |
spellingShingle |
Science::Mathematics::Discrete mathematics Ly, Tevbot Fairness and incentives in committee election |
description |
The committee election problem is to choose from a finite set of candidates a fixed size subset of committee members. The function to do so is called committee election rule. The committee election rule takes in the input of voters' preference information and produces an output of a committee. We want the committee election rule to satisfy some desirable properties. Notions of fairness and strategyproofness are studied extensively in the vast majority of the literature of the sort. In general, we want the committee to be able to "fairly" represent their voters and to be strategyproof and therefore is not subject to voter manipulation. The objective of this paper is to study the existence of such election rule that satisfy these two important properties and to provide the algorithm in finding these election rules in the cases that they exist. |
author2 |
Bei Xiaohui |
author_facet |
Bei Xiaohui Ly, Tevbot |
format |
Final Year Project |
author |
Ly, Tevbot |
author_sort |
Ly, Tevbot |
title |
Fairness and incentives in committee election |
title_short |
Fairness and incentives in committee election |
title_full |
Fairness and incentives in committee election |
title_fullStr |
Fairness and incentives in committee election |
title_full_unstemmed |
Fairness and incentives in committee election |
title_sort |
fairness and incentives in committee election |
publisher |
Nanyang Technological University |
publishDate |
2020 |
url |
https://hdl.handle.net/10356/144802 |
_version_ |
1759853396155695104 |