Imagen de Portada

Necessary President in Elections with Parties

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Cechlárová, Katarína, Schlotter, Ildikó
Formato:	Preprint
Publicado:	2026
Materias:	Computer Science and Game Theory Computational Complexity
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

Candidate nomination for Condorcet-consistent voting rules
por: Schlotter, Ildikó, et al.
Publicado: (2025)

Solving Four Open Problems about Core Stability in Altruistic Hedonic Games
por: Rothe, Jörg, et al.
Publicado: (2025)

Navigating the Complexity Landscape of Nominee Selection in Schulze Voting
por: Cechlárová, Katarína, et al.
Publicado: (2026)

Complexity of Stability in Trading Networks
por: Fleiner, Tamás, et al.
Publicado: (2018)

Computing Equilibrium Nominations in Presidential Elections
por: Faliszewski, Piotr, et al.
Publicado: (2025)

Control in Stable Marriage and Stable Roommates: Complexity and Algorithms
por: Chen, Jiehua, et al.
Publicado: (2025)

Committee Elections with Candidate Attribute Constraints
por: Zhou, Aizhong, et al.
Publicado: (2024)

Identifying Imperfect Clones in Elections
por: Faliszewski, Piotr, et al.
Publicado: (2025)

A Computational Analysis of Strategic Nominations: Modeling Equilibrium and Complexity in Organizational Elections
por: Lin, Chuang-Chieh, et al.
Publicado: (2023)

Parameterized Algorithms for Optimal Refugee Resettlement
por: Chen, Jiehua, et al.
Publicado: (2024)

The Strong Core of Housing Markets with Partial Order Preferences
por: Schlotter, Ildikó, et al.
Publicado: (2025)

Controlling Borda Elections by Adding or Deleting either Votes or Candidates: Complete and Top-Truncated Votes
por: Zhou, Aizhong, et al.
Publicado: (2024)

The Complexity of Strategic Behavior in Primary Elections
por: Cleveland, Colin, et al.
Publicado: (2026)

Stable Hypergraph Matching in Unimodular Hypergraphs
por: Biró, Péter, et al.
Publicado: (2025)

Constant Inapproximability for Fisher Markets
por: Deligkas, Argyrios, et al.
Publicado: (2026)

Modelling Network Resilience: The Complexity of Some Graph Division Games
por: Gutowski, Grzegorz, et al.
Publicado: (2026)

Bribery's Influence on Ranked Aggregation
por: Jain, Pallavi, et al.
Publicado: (2026)

On the Complexity of Learning Nash Equilibria
por: Biggar, Oliver, et al.
Publicado: (2026)

Fisher Markets with Approximately Optimal Bundles and the Need for a PCP Theorem for PPAD
por: Deligkas, Argyrios, et al.
Publicado: (2026)

The Complexity of Min-Max Optimization with Product Constraints
por: Bernasconi, Martino, et al.
Publicado: (2026)

Minimizing the Cost of EFx Allocations
por: Deltl, Eva
Publicado: (2026)

Hardness of Approximate Hylland-Zeckhauser Equilibria
por: Braverman, Mark, et al.
Publicado: (2026)

On the Smoothed Complexity of Combinatorial Local Search
por: Giannakopoulos, Yiannis, et al.
Publicado: (2022)

How to Resolve Envy by Adding Goods
por: Bentert, Matthias, et al.
Publicado: (2025)

Smoothed analysis of deterministic discounted and mean-payoff games
por: Loff, Bruno, et al.
Publicado: (2024)

On the Complexity of Stationary Nash Equilibria in Discounted Perfect Information Stochastic Games
por: Hansen, Kristoffer Arnsfelt, et al.
Publicado: (2025)

Disrupting Bipartite Trading Networks: Matching for Revenue Maximization
por: D'Amico-Wong, Luca, et al.
Publicado: (2024)

Hardness of Approximate Sperner and Applications to Envy-Free Cake Cutting
por: Gao, Ruiquan, et al.
Publicado: (2024)

The Randomized Query Complexity of Finding a Tarski Fixed Point on the Boolean Hypercube
por: Brânzei, Simina, et al.
Publicado: (2024)

Skating System Unveiled: Exploring Preference Aggregation in Ballroom Tournaments
por: Horn, Laryssa, et al.
Publicado: (2025)

The Complexity of Symmetric Equilibria in Min-Max Optimization and Team Zero-Sum Games
por: Anagnostides, Ioannis, et al.
Publicado: (2025)

Constant Inapproximability for PPA
por: Deligkas, Argyrios, et al.
Publicado: (2022)

Spatial Voting with Incomplete Voter Information
por: Imber, Aviram, et al.
Publicado: (2023)

Efficiently Computing Equilibria in Budget-Aggregation Games
por: Becker, Patrick, et al.
Publicado: (2025)

Can Almost Everybody be Almost Happy? PCP for PPAD and the Inapproximability of Nash
por: Babichenko, Yakov, et al.
Publicado: (2015)

The Complexity of Symmetric Bimatrix Games with Common Payoffs
por: Ghosh, Abheek, et al.
Publicado: (2024)

Complexity of Manipulation and Bribery in Premise-Based Judgment Aggregation with Simple Formulas
por: Bredereck, Robert, et al.
Publicado: (2024)

Reachability of Fair Allocations via Sequential Exchanges
por: Igarashi, Ayumi, et al.
Publicado: (2023)

Reforming an Unfair Allocation by Exchanging Goods
por: Yuen, Sheung Man, et al.
Publicado: (2024)

On the Computation of Equilibria in Discrete First-Price Auctions
por: Filos-Ratsikas, Aris, et al.
Publicado: (2024)