Imagen de Portada

Complexity of Manipulation and Bribery in Premise-Based Judgment Aggregation with Simple Formulas

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Bredereck, Robert, Luo, Junjie
Formato:	Preprint
Publicado:	2024
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

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

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

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

Bribery Can Get Harder in Structured Multiwinner Approval Election
por: Kusek, Bartosz, et al.
Publicado: (2022)

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

Computing Efficient Envy-Free Partial Allocations of Indivisible Goods
por: Bredereck, Robert, et al.
Publicado: (2025)

The Computational Complexity of the Housing Market
por: Lock, Edwin, et al.
Publicado: (2024)

Complexity and Manipulation of International Kidney Exchange Programmes with Country-Specific Parameters
por: Colley, Rachael, et al.
Publicado: (2025)

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

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

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

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

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

Ex-post Stability under Two-Sided Matching: Complexity and Characterization
por: Aziz, Haris, 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)

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

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

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

The Complexity of Optimizing Atomic Congestion
por: Brand, Cornelius, et al.
Publicado: (2023)

Complexity of Round-Robin Allocation with Potentially Noisy Queries
por: Li, Zihan, et al.
Publicado: (2024)

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

Structural Complexities of Matching Mechanisms
por: Gonczarowski, Yannai A., et al.
Publicado: (2022)

Computational Social Choice: Parameterized Complexity and Challenges
por: Chen, Jiehua, et al.
Publicado: (2024)

The Complexity of Sparse Win-Lose Bimatrix Games
por: Batziou, Eleni, et al.
Publicado: (2026)

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

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

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

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

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

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)

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
por: Kaczmarek, Joanna, et al.
Publicado: (2024)

Tight Inapproximability of Nash Equilibria in Public Goods Games
por: Dinh, Jérémi Do, et al.
Publicado: (2024)

Envy-Free House Allocation with Minimum Subsidy
por: Choo, Davin, et al.
Publicado: (2024)

Improved Hardness Results for Min-Max Optimization with Coupled Constraints
por: Bernasconi, Martino, et al.
Publicado: (2024)

Communication Separations for Truthful Auctions: Breaking the Two-Player Barrier
por: Ron, Shiri, et al.
Publicado: (2024)

Persuading a Credible Agent
por: Gan, Jiarui, et al.
Publicado: (2024)

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

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

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