東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

FindBook

Google Book

Amazon

博客來

Theoretical and Practical Advances in Computational Social Choice and Crowdsourcing.

紀錄類型:	書目-電子資源 : Monograph/item
正題名/作者:	Theoretical and Practical Advances in Computational Social Choice and Crowdsourcing./
作者:	Yoo, Yeawon.
出版者:	Ann Arbor : ProQuest Dissertations & Theses, : 2021,
面頁冊數:	142 p.
附註:	Source: Dissertations Abstracts International, Volume: 83-03, Section: B.
Contained By:	Dissertations Abstracts International83-03B.
標題:	Operations research. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28549024
ISBN:	9798535542010

Theoretical and Practical Advances in Computational Social Choice and Crowdsourcing.
Yoo, Yeawon.

Theoretical and Practical Advances in Computational Social Choice and Crowdsourcing. - Ann Arbor : ProQuest Dissertations & Theses, 2021 - 142 p.

Source: Dissertations Abstracts International, Volume: 83-03, Section: B.

Thesis (Ph.D.)--Arizona State University, 2021.

This item must not be sold to any third party vendors.

Computational social choice theory is an emerging research area that studies the computational aspects of decision-making. It continues to be relevant in modern society because many people often work as a group and make decisions in a group setting. Among multiple research topics, rank aggregation is a central problem in computational social choice theory. Oftentimes, rankings may involve a large number of alternatives, contain ties, and/or be incomplete, all of which complicate the use of robust aggregation methods.To address these challenges, firstly, this work introduces a correlation coefficient that is designed to deal with a variety of ranking formats including those containing non-strict (i.e., with-ties) and incomplete (i.e., unknown) preferences. The new measure, which can be regarded as a generalization of the seminal Kendall tau correlation coefficient, is proven to satisfy a set of metric-like axioms and to be equivalent to a recently developed ranking distance function associated with Kemeny aggregation.Secondly, this work derives an exact binary programming formulation for the generalized Kemeny rank aggregation problem-whose ranking inputs may be complete and incomplete, with and without ties. It leverages the equivalence of minimizing the Kemeny-Snell distance and maximizing the Kendall-tau correlation, to compare the newly introduced binary programming formulation to a modified version of an existing integer programming formulation associated with the Kendall-tau distance.Thirdly, this work introduces a new social choice property for decomposing large-size problems into smaller subproblems, which allows solving the problem in a distributed fashion. The new property is adequate for handling complete rankings with ties. The property is leveraged to develop a structural decomposition algorithm, through which certain large instances of the NP-hard Kemeny rank aggregation problem can be solved exactly in a practical amount of time.Lastly, this work applies these rank aggregation mechanisms to novel contexts for extracting collective wisdom in crowdsourcing tasks. Through this crowdsourcing experiment, we assess the capability of aggregation frameworks to recover underlying ground truth and the usefulness of multimodal information in overcoming anchoring effects, which shows its ability to enhance the wisdom of crowds and its practicability to the real-world problem.

ISBN: 9798535542010Subjects--Topical Terms:

547123
Operations research.
Subjects--Index Terms:

Combinatorial Optimization

Theoretical and Practical Advances in Computational Social Choice and Crowdsourcing.
LDR:03658nmm a2200385 4500 001 2350475
005 20221020125952.5
008 241004s2021 ||||||||||||||||| ||eng d
020 $a 9798535542010
035 $a (MiAaPQ)AAI28549024
035 $a AAI28549024
040 $a MiAaPQ $c MiAaPQ
100 1 $a Yoo, Yeawon. $3 3689962
245 1 0 $a Theoretical and Practical Advances in Computational Social Choice and Crowdsourcing.
260 1 $a Ann Arbor : $b ProQuest Dissertations & Theses, $c 2021
300 $a 142 p.
500 $a Source: Dissertations Abstracts International, Volume: 83-03, Section: B.
500 $a Advisor: Escobedo, Adolfo R.
502 $a Thesis (Ph.D.)--Arizona State University, 2021.
506 $a This item must not be sold to any third party vendors.
520 $a Computational social choice theory is an emerging research area that studies the computational aspects of decision-making. It continues to be relevant in modern society because many people often work as a group and make decisions in a group setting. Among multiple research topics, rank aggregation is a central problem in computational social choice theory. Oftentimes, rankings may involve a large number of alternatives, contain ties, and/or be incomplete, all of which complicate the use of robust aggregation methods.To address these challenges, firstly, this work introduces a correlation coefficient that is designed to deal with a variety of ranking formats including those containing non-strict (i.e., with-ties) and incomplete (i.e., unknown) preferences. The new measure, which can be regarded as a generalization of the seminal Kendall tau correlation coefficient, is proven to satisfy a set of metric-like axioms and to be equivalent to a recently developed ranking distance function associated with Kemeny aggregation.Secondly, this work derives an exact binary programming formulation for the generalized Kemeny rank aggregation problem-whose ranking inputs may be complete and incomplete, with and without ties. It leverages the equivalence of minimizing the Kemeny-Snell distance and maximizing the Kendall-tau correlation, to compare the newly introduced binary programming formulation to a modified version of an existing integer programming formulation associated with the Kendall-tau distance.Thirdly, this work introduces a new social choice property for decomposing large-size problems into smaller subproblems, which allows solving the problem in a distributed fashion. The new property is adequate for handling complete rankings with ties. The property is leveraged to develop a structural decomposition algorithm, through which certain large instances of the NP-hard Kemeny rank aggregation problem can be solved exactly in a practical amount of time.Lastly, this work applies these rank aggregation mechanisms to novel contexts for extracting collective wisdom in crowdsourcing tasks. Through this crowdsourcing experiment, we assess the capability of aggregation frameworks to recover underlying ground truth and the usefulness of multimodal information in overcoming anchoring effects, which shows its ability to enhance the wisdom of crowds and its practicability to the real-world problem.
590 $a School code: 0010.
650 4 $a Operations research. $3 547123
650 4 $a Web studies. $3 2122754
650 4 $a Mathematical programming. $3 3683785
650 4 $a Emergency medical care. $3 3563184
650 4 $a Search engines. $3 869493
650 4 $a Integer programming. $3 648270
650 4 $a Accuracy. $3 3559958
650 4 $a Datasets. $3 3541416
650 4 $a Bioinformatics. $3 553671
650 4 $a Demographics. $3 3540640
650 4 $a Decision making. $3 517204
650 4 $a Professional baseball. $3 3563169
650 4 $a Data collection. $3 3561708
650 4 $a Algorithms. $3 536374
650 4 $a Ratings & rankings. $3 3562221
650 4 $a Candidates. $3 3560859
650 4 $a Crowdsourcing. $3 3377825
653 $a Combinatorial Optimization
653 $a Computational social choice
653 $a Crowdsourcing
653 $a Group decision-making
653 $a Multimodal information
653 $a Rank aggregation
690 $a 0796
690 $a 0646
690 $a 0715
710 2 $a Arizona State University. $b Industrial Engineering. $3 2098642
773 0 $t Dissertations Abstracts International $g 83-03B.
790 $a 0010
791 $a Ph.D.
792 $a 2021
793 $a English
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=28549024