Image de couverture de livre

Skating System Unveiled: Exploring Preference Aggregation in Ballroom Tournaments

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Horn, Laryssa, Nüsken, Paul, Rothe, Jörg, Seeger, Tessa
Format:	Preprint
Publié:	2025
Sujets:	Computer Science and Game Theory Computational Complexity
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

Toward Completing the Picture of Control in Schulze and Ranked Pairs Elections
par: Maushagen, Cynthia, et autres
Publié: (2024)

Solving Four Open Problems about Core Stability in Altruistic Hedonic Games
par: Rothe, Jörg, et autres
Publié: (2025)

Control by Adding Players to Change or Maintain the Shapley-Shubik or the Penrose-Banzhaf Power Index in Weighted Voting Games Is Complete for NP^PP
par: Kaczmarek, Joanna, et autres
Publié: (2024)

Bribery's Influence on Ranked Aggregation
par: Jain, Pallavi, et autres
Publié: (2026)

Efficiently Computing Equilibria in Budget-Aggregation Games
par: Becker, Patrick, et autres
Publié: (2025)

Complexity of Manipulation and Bribery in Premise-Based Judgment Aggregation with Simple Formulas
par: Bredereck, Robert, et autres
Publié: (2024)

On the Complexity of the Optimal Correlated Equilibria in Extensive-Form Games
par: Cheval, Vincent, et autres
Publié: (2025)

How to Tamper with a Parliament: Strategic Campaigns in Apportionment Elections
par: Bredereck, Robert, et autres
Publié: (2026)

How to Resolve Envy by Adding Goods
par: Bentert, Matthias, et autres
Publié: (2025)

On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
par: Hansen, Kristoffer Arnsfelt, et autres
Publié: (2025)

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
par: Anagnostides, Ioannis, et autres
Publié: (2025)

Equilibrium and Selfish Behavior in Network Contagion
par: Zhang, Yi, et autres
Publié: (2025)

Equilibrium Computation in First-Price Auctions with Correlated Priors
par: Filos-Ratsikas, Aris, et autres
Publié: (2025)

Constant Inapproximability of Pacing Equilibria in Second-Price Auctions
par: Chen, Xi, et autres
Publié: (2025)

Reducing the complexity of computing the values of a Nash equilibrium
par: Chatterjee, Debtoru, et autres
Publié: (2025)

Tarski Lower Bounds from Multi-Dimensional Herringbones
par: Brânzei, Simina, et autres
Publié: (2025)

On Minimal Achievable Quotas in Multiwinner Voting
par: Becker, Patrick, et autres
Publié: (2025)

On the Smoothed Complexity of Combinatorial Local Search
par: Giannakopoulos, Yiannis, et autres
Publié: (2022)

A Computational Analysis of Strategic Nominations: Modeling Equilibrium and Complexity in Organizational Elections
par: Lin, Chuang-Chieh, et autres
Publié: (2023)

Constant Inapproximability for Fisher Markets
par: Deligkas, Argyrios, et autres
Publié: (2026)

Smoothed analysis of deterministic discounted and mean-payoff games
par: Loff, Bruno, et autres
Publié: (2024)

Disrupting Bipartite Trading Networks: Matching for Revenue Maximization
par: D'Amico-Wong, Luca, et autres
Publié: (2024)

Controlling Borda Elections by Adding or Deleting either Votes or Candidates: Complete and Top-Truncated Votes
par: Zhou, Aizhong, et autres
Publié: (2024)

Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting
par: Gao, Ruiquan, et autres
Publié: (2024)

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
par: Brânzei, Simina, et autres
Publié: (2024)

Committee Elections with Candidate Attribute Constraints
par: Zhou, Aizhong, et autres
Publié: (2024)

Modelling Network Resilience: The Complexity of Some Graph Division Games
par: Gutowski, Grzegorz, et autres
Publié: (2026)

Constant Inapproximability for PPA
par: Deligkas, Argyrios, et autres
Publié: (2022)

Spatial Voting with Incomplete Voter Information
par: Imber, Aviram, et autres
Publié: (2023)

On the Complexity of Learning Nash Equilibria
par: Biggar, Oliver, et autres
Publié: (2026)

Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash
par: Babichenko, Yakov, et autres
Publié: (2015)

The Complexity of Symmetric Bimatrix Games with Common Payoffs
par: Ghosh, Abheek, et autres
Publié: (2024)

Reachability of Fair Allocations via Sequential Exchanges
par: Igarashi, Ayumi, et autres
Publié: (2023)

Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD
par: Deligkas, Argyrios, et autres
Publié: (2026)

Reforming an Unfair Allocation by Exchanging Goods
par: Yuen, Sheung Man, et autres
Publié: (2024)

On the Computation of Equilibria in Discrete First-Price Auctions
par: Filos-Ratsikas, Aris, et autres
Publié: (2024)

The Complexity of Min-Max Optimization with Product Constraints
par: Bernasconi, Martino, et autres
Publié: (2026)

Envy-Free Cake-Cutting for Four Agents
par: Hollender, Alexandros, et autres
Publié: (2023)

Tight Inapproximability of Nash Equilibria in Public Goods Games
par: Dinh, Jérémi Do, et autres
Publié: (2024)

Envy-Free House Allocation with Minimum Subsidy
par: Choo, Davin, et autres
Publié: (2024)