The use of domain knowledge in optimal information aggregation

Author(s)
Pickard, Galen
Thumbnail
DownloadFull printable version (1.515Mb)
Alternative title
use of knowledge structures in optimal information aggregation
Other Contributors
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Advisor
Whitman Richards.
Terms of use
M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582
Metadata
Show full item record
Abstract
In this thesis, I present some novel results pertaining to the relationship between two popular and interesting information aggregation methods: the Condorcet and Borda tallies. I present numerical results showing how the much simpler Borda tally can be used to approximate the outcome of the Condorcet tally with high probability in certain circumstances, a proof that there exist classes of problems for which the two tallies can never agree, and an extension of these results to small-world graphs, which have been of great interest recently due to their practical applicability to many complex problems.
Description
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.
 
Includes bibliographical references (leaf 35).
 
Date issued
2006
URI
http://hdl.handle.net/1721.1/37080
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Publisher
Massachusetts Institute of Technology
Keywords
Electrical Engineering and Computer Science.
Collections