Efficient Portfolio Selection through Preference Aggregation with Quicksort and the Bradley--Terry Model Article Swipe
Yufeng Ge
,
Lucas Böttcher
,
Tungshan Chou
,
Maria R. D’Orsogna
·
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2504.16093
YOU?
·
· 2025
· Open Access
·
· DOI: https://doi.org/10.48550/arxiv.2504.16093
How to allocate limited resources to projects that will yield the greatest long-term benefits is a problem that often arises in decision-making under uncertainty. For example, organizations may need to evaluate and select innovation projects with risky returns. Similarly, when allocating resources to research projects, funding agencies are tasked with identifying the most promising proposals based on idiosyncratic criteria. Finally, in participatory budgeting, a local community may need to select a subset of public projects to fund. Regardless of context, agents must estimate the uncertain values of a potentially large number of projects. Developing parsimonious methods to compare these projects, and aggregating agent evaluations so that the overall benefit is maximized, are critical in assembling the best project portfolio. Unlike in standard sorting algorithms, evaluating projects on the basis of uncertain long-term benefits introduces additional complexities. We propose comparison rules based on Quicksort and the Bradley--Terry model, which connects rankings to pairwise "win" probabilities. In our model, each agent determines win probabilities of a pair of projects based on his or her specific evaluation of the projects' long-term benefit. The win probabilities are then appropriately aggregated and used to rank projects. Several of the methods we propose perform better than the two most effective aggregation methods currently available. Additionally, our methods can be combined with sampling techniques to significantly reduce the number of pairwise comparisons. We also discuss how the Bradley--Terry portfolio selection approach can be implemented in practice.
Related Topics
Concepts
No concepts available.
Metadata
- Type
- preprint
- Language
- en
- Landing Page
- https://doi.org/10.48550/arxiv.2504.16093
- OA Status
- green
- OpenAlex ID
- https://openalex.org/W4415064725
All OpenAlex metadata
Raw OpenAlex JSON
- OpenAlex ID
-
https://openalex.org/W4415064725Canonical identifier for this work in OpenAlex
- DOI
-
https://doi.org/10.48550/arxiv.2504.16093Digital Object Identifier
- Title
-
Efficient Portfolio Selection through Preference Aggregation with Quicksort and the Bradley--Terry ModelWork title
- Type
-
preprintOpenAlex work type
- Language
-
enPrimary language
- Publication year
-
2025Year of publication
- Publication date
-
2025-04-06Full publication date if available
- Authors
-
Yufeng Ge, Lucas Böttcher, Tungshan Chou, Maria R. D’OrsognaList of authors in order
- Landing page
-
https://doi.org/10.48550/arxiv.2504.16093Publisher landing page
- Open access
-
YesWhether a free full text is available
- OA status
-
greenOpen access status per OpenAlex
- OA URL
-
https://doi.org/10.48550/arxiv.2504.16093Direct OA link when available
- Cited by
-
0Total citation count in OpenAlex
Full payload
| id | https://openalex.org/W4415064725 |
|---|---|
| doi | https://doi.org/10.48550/arxiv.2504.16093 |
| ids.doi | https://doi.org/10.48550/arxiv.2504.16093 |
| ids.openalex | https://openalex.org/W4415064725 |
| fwci | |
| type | preprint |
| title | Efficient Portfolio Selection through Preference Aggregation with Quicksort and the Bradley--Terry Model |
| biblio.issue | |
| biblio.volume | |
| biblio.last_page | |
| biblio.first_page | |
| topics[0].id | https://openalex.org/T11106 |
| topics[0].field.id | https://openalex.org/fields/17 |
| topics[0].field.display_name | Computer Science |
| topics[0].score | 0.8087000250816345 |
| topics[0].domain.id | https://openalex.org/domains/3 |
| topics[0].domain.display_name | Physical Sciences |
| topics[0].subfield.id | https://openalex.org/subfields/1711 |
| topics[0].subfield.display_name | Signal Processing |
| topics[0].display_name | Data Management and Algorithms |
| topics[1].id | https://openalex.org/T10050 |
| topics[1].field.id | https://openalex.org/fields/18 |
| topics[1].field.display_name | Decision Sciences |
| topics[1].score | 0.7121999859809875 |
| topics[1].domain.id | https://openalex.org/domains/2 |
| topics[1].domain.display_name | Social Sciences |
| topics[1].subfield.id | https://openalex.org/subfields/1803 |
| topics[1].subfield.display_name | Management Science and Operations Research |
| topics[1].display_name | Multi-Criteria Decision Making |
| is_xpac | False |
| apc_list | |
| apc_paid | |
| language | en |
| locations[0].id | doi:10.48550/arxiv.2504.16093 |
| locations[0].is_oa | True |
| locations[0].source.id | https://openalex.org/S4306400194 |
| locations[0].source.issn | |
| locations[0].source.type | repository |
| locations[0].source.is_oa | True |
| locations[0].source.issn_l | |
| locations[0].source.is_core | False |
| locations[0].source.is_in_doaj | False |
| locations[0].source.display_name | arXiv (Cornell University) |
| locations[0].source.host_organization | https://openalex.org/I205783295 |
| locations[0].source.host_organization_name | Cornell University |
| locations[0].source.host_organization_lineage | https://openalex.org/I205783295 |
| locations[0].license | |
| locations[0].pdf_url | |
| locations[0].version | |
| locations[0].raw_type | article |
| locations[0].license_id | |
| locations[0].is_accepted | False |
| locations[0].is_published | |
| locations[0].raw_source_name | |
| locations[0].landing_page_url | https://doi.org/10.48550/arxiv.2504.16093 |
| indexed_in | datacite |
| authorships[0].author.id | https://openalex.org/A5074442339 |
| authorships[0].author.orcid | https://orcid.org/0000-0002-4968-6520 |
| authorships[0].author.display_name | Yufeng Ge |
| authorships[0].author_position | first |
| authorships[0].raw_author_name | Ge, Yurun |
| authorships[0].is_corresponding | False |
| authorships[1].author.id | https://openalex.org/A5088737112 |
| authorships[1].author.orcid | https://orcid.org/0000-0003-1700-1897 |
| authorships[1].author.display_name | Lucas Böttcher |
| authorships[1].author_position | middle |
| authorships[1].raw_author_name | Böttcher, Lucas |
| authorships[1].is_corresponding | False |
| authorships[2].author.id | https://openalex.org/A5076261599 |
| authorships[2].author.orcid | |
| authorships[2].author.display_name | Tungshan Chou |
| authorships[2].author_position | middle |
| authorships[2].raw_author_name | Chou, Tom |
| authorships[2].is_corresponding | False |
| authorships[3].author.id | https://openalex.org/A5060091952 |
| authorships[3].author.orcid | https://orcid.org/0000-0003-2828-9523 |
| authorships[3].author.display_name | Maria R. D’Orsogna |
| authorships[3].author_position | last |
| authorships[3].raw_author_name | D'Orsogna, Maria R. |
| authorships[3].is_corresponding | False |
| has_content.pdf | False |
| has_content.grobid_xml | False |
| is_paratext | False |
| open_access.is_oa | True |
| open_access.oa_url | https://doi.org/10.48550/arxiv.2504.16093 |
| open_access.oa_status | green |
| open_access.any_repository_has_fulltext | False |
| created_date | 2025-10-11T00:00:00 |
| display_name | Efficient Portfolio Selection through Preference Aggregation with Quicksort and the Bradley--Terry Model |
| has_fulltext | False |
| is_retracted | False |
| updated_date | 2025-11-06T06:51:31.235846 |
| primary_topic.id | https://openalex.org/T11106 |
| primary_topic.field.id | https://openalex.org/fields/17 |
| primary_topic.field.display_name | Computer Science |
| primary_topic.score | 0.8087000250816345 |
| primary_topic.domain.id | https://openalex.org/domains/3 |
| primary_topic.domain.display_name | Physical Sciences |
| primary_topic.subfield.id | https://openalex.org/subfields/1711 |
| primary_topic.subfield.display_name | Signal Processing |
| primary_topic.display_name | Data Management and Algorithms |
| cited_by_count | 0 |
| locations_count | 1 |
| best_oa_location.id | doi:10.48550/arxiv.2504.16093 |
| best_oa_location.is_oa | True |
| best_oa_location.source.id | https://openalex.org/S4306400194 |
| best_oa_location.source.issn | |
| best_oa_location.source.type | repository |
| best_oa_location.source.is_oa | True |
| best_oa_location.source.issn_l | |
| best_oa_location.source.is_core | False |
| best_oa_location.source.is_in_doaj | False |
| best_oa_location.source.display_name | arXiv (Cornell University) |
| best_oa_location.source.host_organization | https://openalex.org/I205783295 |
| best_oa_location.source.host_organization_name | Cornell University |
| best_oa_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| best_oa_location.license | |
| best_oa_location.pdf_url | |
| best_oa_location.version | |
| best_oa_location.raw_type | article |
| best_oa_location.license_id | |
| best_oa_location.is_accepted | False |
| best_oa_location.is_published | False |
| best_oa_location.raw_source_name | |
| best_oa_location.landing_page_url | https://doi.org/10.48550/arxiv.2504.16093 |
| primary_location.id | doi:10.48550/arxiv.2504.16093 |
| primary_location.is_oa | True |
| primary_location.source.id | https://openalex.org/S4306400194 |
| primary_location.source.issn | |
| primary_location.source.type | repository |
| primary_location.source.is_oa | True |
| primary_location.source.issn_l | |
| primary_location.source.is_core | False |
| primary_location.source.is_in_doaj | False |
| primary_location.source.display_name | arXiv (Cornell University) |
| primary_location.source.host_organization | https://openalex.org/I205783295 |
| primary_location.source.host_organization_name | Cornell University |
| primary_location.source.host_organization_lineage | https://openalex.org/I205783295 |
| primary_location.license | |
| primary_location.pdf_url | |
| primary_location.version | |
| primary_location.raw_type | article |
| primary_location.license_id | |
| primary_location.is_accepted | False |
| primary_location.is_published | False |
| primary_location.raw_source_name | |
| primary_location.landing_page_url | https://doi.org/10.48550/arxiv.2504.16093 |
| publication_date | 2025-04-06 |
| publication_year | 2025 |
| referenced_works_count | 0 |
| abstract_inverted_index.a | 15, 63, 70, 87, 163 |
| abstract_inverted_index.In | 154 |
| abstract_inverted_index.We | 136, 225 |
| abstract_inverted_index.be | 212, 235 |
| abstract_inverted_index.in | 20, 60, 113, 120, 237 |
| abstract_inverted_index.is | 14, 109 |
| abstract_inverted_index.of | 72, 78, 86, 91, 129, 162, 165, 174, 192, 222 |
| abstract_inverted_index.on | 56, 126, 141, 168 |
| abstract_inverted_index.or | 170 |
| abstract_inverted_index.so | 104 |
| abstract_inverted_index.to | 1, 5, 29, 42, 68, 75, 96, 150, 188, 217 |
| abstract_inverted_index.we | 195 |
| abstract_inverted_index.For | 24 |
| abstract_inverted_index.How | 0 |
| abstract_inverted_index.The | 179 |
| abstract_inverted_index.and | 31, 100, 143, 186 |
| abstract_inverted_index.are | 47, 111, 182 |
| abstract_inverted_index.can | 211, 234 |
| abstract_inverted_index.her | 171 |
| abstract_inverted_index.his | 169 |
| abstract_inverted_index.how | 228 |
| abstract_inverted_index.may | 27, 66 |
| abstract_inverted_index.our | 155, 209 |
| abstract_inverted_index.the | 10, 51, 83, 106, 115, 127, 144, 175, 193, 200, 220, 229 |
| abstract_inverted_index.two | 201 |
| abstract_inverted_index.win | 160, 180 |
| abstract_inverted_index.also | 226 |
| abstract_inverted_index.best | 116 |
| abstract_inverted_index.each | 157 |
| abstract_inverted_index.most | 52, 202 |
| abstract_inverted_index.must | 81 |
| abstract_inverted_index.need | 28, 67 |
| abstract_inverted_index.pair | 164 |
| abstract_inverted_index.rank | 189 |
| abstract_inverted_index.than | 199 |
| abstract_inverted_index.that | 7, 17, 105 |
| abstract_inverted_index.then | 183 |
| abstract_inverted_index.used | 187 |
| abstract_inverted_index.when | 39 |
| abstract_inverted_index.will | 8 |
| abstract_inverted_index.with | 35, 49, 214 |
| abstract_inverted_index."win" | 152 |
| abstract_inverted_index.agent | 102, 158 |
| abstract_inverted_index.based | 55, 140, 167 |
| abstract_inverted_index.basis | 128 |
| abstract_inverted_index.fund. | 76 |
| abstract_inverted_index.large | 89 |
| abstract_inverted_index.local | 64 |
| abstract_inverted_index.often | 18 |
| abstract_inverted_index.risky | 36 |
| abstract_inverted_index.rules | 139 |
| abstract_inverted_index.these | 98 |
| abstract_inverted_index.under | 22 |
| abstract_inverted_index.which | 147 |
| abstract_inverted_index.yield | 9 |
| abstract_inverted_index.Unlike | 119 |
| abstract_inverted_index.agents | 80 |
| abstract_inverted_index.arises | 19 |
| abstract_inverted_index.better | 198 |
| abstract_inverted_index.model, | 146, 156 |
| abstract_inverted_index.number | 90, 221 |
| abstract_inverted_index.public | 73 |
| abstract_inverted_index.reduce | 219 |
| abstract_inverted_index.select | 32, 69 |
| abstract_inverted_index.subset | 71 |
| abstract_inverted_index.tasked | 48 |
| abstract_inverted_index.values | 85 |
| abstract_inverted_index.Several | 191 |
| abstract_inverted_index.benefit | 108 |
| abstract_inverted_index.compare | 97 |
| abstract_inverted_index.discuss | 227 |
| abstract_inverted_index.funding | 45 |
| abstract_inverted_index.limited | 3 |
| abstract_inverted_index.methods | 95, 194, 205, 210 |
| abstract_inverted_index.overall | 107 |
| abstract_inverted_index.perform | 197 |
| abstract_inverted_index.problem | 16 |
| abstract_inverted_index.project | 117 |
| abstract_inverted_index.propose | 137, 196 |
| abstract_inverted_index.sorting | 122 |
| abstract_inverted_index.Finally, | 59 |
| abstract_inverted_index.agencies | 46 |
| abstract_inverted_index.allocate | 2 |
| abstract_inverted_index.approach | 233 |
| abstract_inverted_index.benefit. | 178 |
| abstract_inverted_index.benefits | 13, 132 |
| abstract_inverted_index.combined | 213 |
| abstract_inverted_index.connects | 148 |
| abstract_inverted_index.context, | 79 |
| abstract_inverted_index.critical | 112 |
| abstract_inverted_index.estimate | 82 |
| abstract_inverted_index.evaluate | 30 |
| abstract_inverted_index.example, | 25 |
| abstract_inverted_index.greatest | 11 |
| abstract_inverted_index.pairwise | 151, 223 |
| abstract_inverted_index.projects | 6, 34, 74, 125, 166 |
| abstract_inverted_index.rankings | 149 |
| abstract_inverted_index.research | 43 |
| abstract_inverted_index.returns. | 37 |
| abstract_inverted_index.sampling | 215 |
| abstract_inverted_index.specific | 172 |
| abstract_inverted_index.standard | 121 |
| abstract_inverted_index.Quicksort | 142 |
| abstract_inverted_index.community | 65 |
| abstract_inverted_index.criteria. | 58 |
| abstract_inverted_index.currently | 206 |
| abstract_inverted_index.effective | 203 |
| abstract_inverted_index.long-term | 12, 131, 177 |
| abstract_inverted_index.portfolio | 231 |
| abstract_inverted_index.practice. | 238 |
| abstract_inverted_index.projects' | 176 |
| abstract_inverted_index.projects, | 44, 99 |
| abstract_inverted_index.projects. | 92, 190 |
| abstract_inverted_index.promising | 53 |
| abstract_inverted_index.proposals | 54 |
| abstract_inverted_index.resources | 4, 41 |
| abstract_inverted_index.selection | 232 |
| abstract_inverted_index.uncertain | 84, 130 |
| abstract_inverted_index.Developing | 93 |
| abstract_inverted_index.Regardless | 77 |
| abstract_inverted_index.Similarly, | 38 |
| abstract_inverted_index.additional | 134 |
| abstract_inverted_index.aggregated | 185 |
| abstract_inverted_index.allocating | 40 |
| abstract_inverted_index.assembling | 114 |
| abstract_inverted_index.available. | 207 |
| abstract_inverted_index.budgeting, | 62 |
| abstract_inverted_index.comparison | 138 |
| abstract_inverted_index.determines | 159 |
| abstract_inverted_index.evaluating | 124 |
| abstract_inverted_index.evaluation | 173 |
| abstract_inverted_index.innovation | 33 |
| abstract_inverted_index.introduces | 133 |
| abstract_inverted_index.maximized, | 110 |
| abstract_inverted_index.portfolio. | 118 |
| abstract_inverted_index.techniques | 216 |
| abstract_inverted_index.aggregating | 101 |
| abstract_inverted_index.aggregation | 204 |
| abstract_inverted_index.algorithms, | 123 |
| abstract_inverted_index.evaluations | 103 |
| abstract_inverted_index.identifying | 50 |
| abstract_inverted_index.implemented | 236 |
| abstract_inverted_index.potentially | 88 |
| abstract_inverted_index.comparisons. | 224 |
| abstract_inverted_index.parsimonious | 94 |
| abstract_inverted_index.uncertainty. | 23 |
| abstract_inverted_index.Additionally, | 208 |
| abstract_inverted_index.appropriately | 184 |
| abstract_inverted_index.complexities. | 135 |
| abstract_inverted_index.idiosyncratic | 57 |
| abstract_inverted_index.organizations | 26 |
| abstract_inverted_index.participatory | 61 |
| abstract_inverted_index.probabilities | 161, 181 |
| abstract_inverted_index.significantly | 218 |
| abstract_inverted_index.Bradley--Terry | 145, 230 |
| abstract_inverted_index.probabilities. | 153 |
| abstract_inverted_index.decision-making | 21 |
| cited_by_percentile_year | |
| countries_distinct_count | 0 |
| institutions_distinct_count | 4 |
| citation_normalized_percentile |