Designing Rules for Choosing a Winner in a Debate
Fuente:
arXiv
Guardado en:
| Autores principales: | Heckett, Alexander, Conitzer, Vincent |
|---|---|
| Formato: | Preprint |
| Publicado: |
2025
|
| Materias: | |
| Acceso en línea: | |
| Etiquetas: |
Agregar Etiqueta
Sin Etiquetas, Sea el primero en etiquetar este registro!
|
Ejemplares similares
Computing Optimal Equilibria in Repeated Games with Restarts
por: Berker, Ratip Emin, et al.
Publicado: (2024)
por: Berker, Ratip Emin, et al.
Publicado: (2024)
Choosing What Game to Play without Selecting Equilibria: Inferring Safe (Pareto) Improvements in Binary Constraint Structures
por: Oesterheld, Caspar, et al.
Publicado: (2025)
por: Oesterheld, Caspar, et al.
Publicado: (2025)
Designing Rules to Pick a Rule: Aggregation by Consistency
por: Berker, Ratip Emin, et al.
Publicado: (2025)
por: Berker, Ratip Emin, et al.
Publicado: (2025)
The Complexity of Computing Robust Mediated Equilibria in Ordinal Games
por: Conitzer, Vincent
Publicado: (2024)
por: Conitzer, Vincent
Publicado: (2024)
Robustness of Approval-Based Multiwinner Voting Rules
por: Faliszewski, Piotr, et al.
Publicado: (2026)
por: Faliszewski, Piotr, et al.
Publicado: (2026)
Game Theory with Simulation of Other Players
por: Kovarik, Vojtech, et al.
Publicado: (2023)
por: Kovarik, Vojtech, et al.
Publicado: (2023)
Distortion of Multi-Winner Elections on the Line Metric: The Polar Comparison Rule
por: Babashah, Negar, et al.
Publicado: (2024)
por: Babashah, Negar, et al.
Publicado: (2024)
Matching Markets with Chores
por: Garg, Jugal, et al.
Publicado: (2024)
por: Garg, Jugal, et al.
Publicado: (2024)
Bribery Can Get Harder in Structured Multiwinner Approval Election
por: Kusek, Bartosz, et al.
Publicado: (2022)
por: Kusek, Bartosz, et al.
Publicado: (2022)
Matroid Bayesian Online Selection
por: DeHaan, Ian, et al.
Publicado: (2024)
por: DeHaan, Ian, et al.
Publicado: (2024)
Randomized Strategyproof Mechanisms with Best of Both Worlds Fairness and Efficiency
por: Sun, Ankang, et al.
Publicado: (2024)
por: Sun, Ankang, et al.
Publicado: (2024)
A Fair Allocation is Approximately Optimal for Indivisible Chores, or Is It?
por: Li, Bo, et al.
Publicado: (2024)
por: Li, Bo, et al.
Publicado: (2024)
On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games
por: Cheval, Vincent, et al.
Publicado: (2025)
por: Cheval, Vincent, et al.
Publicado: (2025)
Aggregating Quantitative Relative Judgments: From Social Choice to Ranking Prediction
por: Xu, Yixuan Even, et al.
Publicado: (2024)
por: Xu, Yixuan Even, et al.
Publicado: (2024)
Maximizing Social Welfare with Side Payments
por: Geffner, Ivan, et al.
Publicado: (2025)
por: Geffner, Ivan, et al.
Publicado: (2025)
Can CDT rationalise the ex ante optimal policy via modified anthropics?
por: Cooper, Emery, et al.
Publicado: (2024)
por: Cooper, Emery, et al.
Publicado: (2024)
Recursive Joint Simulation in Games
por: Kovarik, Vojtech, et al.
Publicado: (2024)
por: Kovarik, Vojtech, et al.
Publicado: (2024)
On the Edge of Core (Non-)Emptiness: An Automated Reasoning Approach to Approval-Based Multi-Winner Voting
por: Berker, Ratip Emin, et al.
Publicado: (2025)
por: Berker, Ratip Emin, et al.
Publicado: (2025)
Multidimensional Budget-Feasible Mechanism Design
por: Neogi, Rian, et al.
Publicado: (2025)
por: Neogi, Rian, et al.
Publicado: (2025)
The Complexity of Graph Exploration Games
por: Fuchs, Janosch, et al.
Publicado: (2023)
por: Fuchs, Janosch, et al.
Publicado: (2023)
Complexity of Unambiguous Problems in $Σ^P_2$
por: Gilboa, Matan, et al.
Publicado: (2025)
por: Gilboa, Matan, et al.
Publicado: (2025)
Single-Winner Voting on Matchings
por: Boehmer, Niclas, et al.
Publicado: (2026)
por: Boehmer, Niclas, et al.
Publicado: (2026)
A Counterexample to EFX $n \ge 3$ Agents, $m \ge n + 5$ Items, Submodular Valuations via SAT-Solving
por: Akrami, Hannaneh, et al.
Publicado: (2026)
por: Akrami, Hannaneh, et al.
Publicado: (2026)
An Interpretable Automated Mechanism Design Framework with Large Language Models
por: Liu, Jiayuan, et al.
Publicado: (2025)
por: Liu, Jiayuan, et al.
Publicado: (2025)
Game Theory with Simulation in the Presence of Unpredictable Randomisation
por: Kovarik, Vojtech, et al.
Publicado: (2024)
por: Kovarik, Vojtech, et al.
Publicado: (2024)
Adjusted Winner: from Splitting to Selling
por: Bredereck, Robert, et al.
Publicado: (2026)
por: Bredereck, Robert, et al.
Publicado: (2026)
Zero Carbon V2X Tariffs for Non-Domestic Customers
por: Shamash, Elisheva S, et al.
Publicado: (2025)
por: Shamash, Elisheva S, et al.
Publicado: (2025)
Time-Efficient Algorithms for Nash-Bargaining-Based Matching Market Models
por: Panageas, Ioannis, et al.
Publicado: (2021)
por: Panageas, Ioannis, et al.
Publicado: (2021)
On Robust Popular Matchings with Tie-Bounded Preferences and Stable Matchings with Two-Sided Ties
por: De, Koustav
Publicado: (2025)
por: De, Koustav
Publicado: (2025)
Selling Privacy in Blockchain Transactions
por: Chionas, Georgios, et al.
Publicado: (2025)
por: Chionas, Georgios, et al.
Publicado: (2025)
A Unified Framework for Weighted Hypergraphic Networks and Fractional Matching
por: Castera, Rémi, et al.
Publicado: (2026)
por: Castera, Rémi, et al.
Publicado: (2026)
Beyond Winner-Take-All Procurement Auctions
por: Garimidi, Pranav, et al.
Publicado: (2026)
por: Garimidi, Pranav, et al.
Publicado: (2026)
Simple Stochastic Stopping Games: A Generator and Benchmark Library
por: Rudich, Avi, et al.
Publicado: (2024)
por: Rudich, Avi, et al.
Publicado: (2024)
Characterising Simulation-Based Program Equilibria
por: Cooper, Emery, et al.
Publicado: (2024)
por: Cooper, Emery, et al.
Publicado: (2024)
What Voting Rules Actually Do: A Data-Driven Analysis of Multi-Winner Voting
por: Caiata, Joshua, et al.
Publicado: (2025)
por: Caiata, Joshua, et al.
Publicado: (2025)
Steering No-Regret Learners to a Desired Equilibrium
por: Zhang, Brian Hu, et al.
Publicado: (2023)
por: Zhang, Brian Hu, et al.
Publicado: (2023)
Finding Possible Winners in Spatial Voting with Incomplete Information
por: Shachnai, Hadas, et al.
Publicado: (2025)
por: Shachnai, Hadas, et al.
Publicado: (2025)
Super Condorcet Winners and Limit Coalitional Manipulability of IRV
por: Durand, François, et al.
Publicado: (2026)
por: Durand, François, et al.
Publicado: (2026)
Reactive Synthesis for Expected Impacts
por: Chini, Emanuele, et al.
Publicado: (2024)
por: Chini, Emanuele, et al.
Publicado: (2024)
Beyond Symmetry in Repeated Games with Restarts
por: Fleischmann, Henry, et al.
Publicado: (2025)
por: Fleischmann, Henry, et al.
Publicado: (2025)
Ejemplares similares
-
Computing Optimal Equilibria in Repeated Games with Restarts
por: Berker, Ratip Emin, et al.
Publicado: (2024) -
Choosing What Game to Play without Selecting Equilibria: Inferring Safe (Pareto) Improvements in Binary Constraint Structures
por: Oesterheld, Caspar, et al.
Publicado: (2025) -
Designing Rules to Pick a Rule: Aggregation by Consistency
por: Berker, Ratip Emin, et al.
Publicado: (2025) -
The Complexity of Computing Robust Mediated Equilibria in Ordinal Games
por: Conitzer, Vincent
Publicado: (2024) -
Robustness of Approval-Based Multiwinner Voting Rules
por: Faliszewski, Piotr, et al.
Publicado: (2026)