Show simple item record

dc.contributor.advisor Soltys, Dr. Michael
dc.contributor.author Devlin, Christopher R.
dc.date.accessioned 2020-01-07T23:05:56Z
dc.date.available 2020-01-07T23:05:56Z
dc.date.issued 2019-12
dc.identifier.uri http://hdl.handle.net/10211.3/214761
dc.description.abstract Voting and choice aggregation are used widely not just in politics but in business decision making processes and other areas such as competitive bidding procurement. Stakeholders and others who rely on these systems require them to be fast, efficient, and, most importantly, fair. The focus of this thesis is to illustrate the complexities inherent in voting systems. The algorithms intrinsic in several voting systems are made explicit as a way to simplify choices among these systems. The systematic evaluation of the algorithms associated with choice aggregation will provide a groundwork for future research and the implementation of these tools across public and private spheres. en_US
dc.format.extent 81 en_US
dc.language.iso en_US en_US
dc.publisher California State University Channel Islands en_US
dc.subject Computer Science thesis en_US
dc.title Voting Systems: From Method to Algorithm en_US
dc.type Thesis en_US
dc.contributor.committeeMember Abbasi, Dr. Bahareh
dc.contributor.committeeMember Vakilian, Dr. Vida
dc.contributor.committeeMember Özturgut, Dr. Osman

Files in this item


This item appears in the following Collection(s)

Show simple item record

Search DSpace

My Account

RSS Feeds