| dc.contributor.author | Airiau, Stéphane | |
| dc.contributor.author | Kruger, Justin | |
| dc.date.accessioned | 2019-04-01T13:04:19Z | |
| dc.date.available | 2019-04-01T13:04:19Z | |
| dc.date.issued | 2017 | |
| dc.identifier.uri | https://basepub.dauphine.fr/handle/123456789/18588 | |
| dc.language.iso | en | en |
| dc.subject | tournament | |
| dc.subject | probabilistic rule | |
| dc.subject | refinements | |
| dc.subject | Condorcet consistency | |
| dc.subject.ddc | 003 | en |
| dc.title | Refinements and Randomised Versions of Some Tournament Solutions | |
| dc.type | Communication / Conférence | |
| dc.description.abstracten | We consider voting rules that are based on the majority graph. Such rules typically output large sets of winners. Our goal is to investigate a general method which leads to refinements of such rules. In particular, we use the idea of parallel universes, where each universe is connected with a permutation over alternatives. The permutation allows us to construct resolute voting rules (i.e. rules that always choose unique winners). Such resolute rules can be constructed in a variety of ways: we consider using binary voting trees to select a single alternative. In turn this permits the construction of neutral rules that output the set the possible winners of every parallel universe. The question of which rules can be constructed in this way has already been partially studied under the heading of agenda implementability. We further propose a randomised version in which the probability of being the winner is the ratio of universes in which the alternative wins. We also investigate (typically novel) rules that elect the alternatives that have maximal winning probability. These rules typically output small sets of winners, thus provide refinements of known tournament solutions. | |
| dc.identifier.citationpages | 1584-1586 | |
| dc.relation.ispartofeditor | Kate Larson, Michael Winikoff, Sanmay Das, Edmund H. Durfee | |
| dc.relation.ispartofpublname | IFAAMAS | |
| dc.subject.ddclabel | Recherche opérationnelle | en |
| dc.relation.conftitle | Proceedings of the 16th Conference on Autonomous Agents and MultiAgent Systems (AAMAS 2017) | |
| dc.relation.confdate | 2017 | |
| dc.relation.confcity | New York, NY | |
| dc.relation.forthcoming | non | en |
| dc.description.ssrncandidate | non | |
| dc.description.halcandidate | oui | |
| dc.description.readership | recherche | |
| dc.description.audience | International | |
| dc.date.updated | 2020-06-12T10:13:02Z | |
| hal.person.labIds | 989 | |
| hal.person.labIds | 989 | |
| hal.identifier | hal-02086676 | * |
