2026-09-19T10:58:10Zhttps://dspace.mit.edu/server/oai/requestoai:dspace.mit.edu:1721.1/370802022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023
Whitman Richards.
Pickard, Galen
Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science.
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
2007-04-03T17:09:27Z
2007-04-03T17:09:27Z
2006
2006
http://hdl.handle.net/1721.1/37080
83288053
Thesis (M. Eng.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2006.
Includes bibliographical references (leaf 35).
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.
bu Galen Pickard.
M.Eng.
35 leaves
eng
Massachusetts Institute of Technology
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
Electrical Engineering and Computer Science.
The use of domain knowledge in optimal information aggregation
use of knowledge structures in optimal information aggregation
Thesis
application/pdf
false
Publication
unknown
unknown
<Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="85eacd0d-5a32-408c-9bc1-3cbe17df58c6">
<Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type>
<Language>eng</Language>
<Title>The use of domain knowledge in optimal information aggregation</Title>
<Subtitle>use of knowledge structures in optimal information aggregation</Subtitle>
<PublishedIn>
<Publication>
</Publication>
</PublishedIn>
<PublicationDate>2006</PublicationDate>
<Authors>
<Author>
<DisplayName>Pickard, Galen</DisplayName>
<Affiliation>
<OrgUnit>
</OrgUnit>
</Affiliation>
</Author>
</Authors>
<Editors>
</Editors>
<Publishers>
<Publisher>
<DisplayName>Massachusetts Institute of Technology</DisplayName>
<OrgUnit />
</Publisher>
</Publishers>
<License>http://dspace.mit.edu/handle/1721.1/7582</License>
<Keyword>Electrical Engineering and Computer Science.</Keyword>
<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.</Abstract>
<Access xmlns="http://purl.org/coar/access_right"
>
</Access>
</Publication>