Cover Image

Spatial Voting with Incomplete Voter Information

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Imber, Aviram, Israel, Jonas, Brill, Markus, Shachnai, Hadas, Kimelfeld, Benny
Format:	Preprint
Published:	2023
Subjects:	Computer Science and Game Theory Computational Complexity
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Approval-Based Committee Voting under Incomplete Information
by: Imber, Aviram, et al.
Published: (2021)

Finding Possible Winners in Spatial Voting with Incomplete Information
by: Shachnai, Hadas, et al.
Published: (2025)

Individual Representation in Approval-Based Committee Voting
by: Brill, Markus, et al.
Published: (2021)

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

On Minimal Achievable Quotas in Multiwinner Voting
by: Becker, Patrick, et al.
Published: (2025)

Online Contract Design
by: Lavi, Elad, et al.
Published: (2026)

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

Multiwinner Temporal Voting with Aversion to Change
by: Zech, Valentin, et al.
Published: (2024)

On the Tractability Landscape of the Conditional Minisum Approval Voting Rule
by: Amanatidis, Georgios, et al.
Published: (2024)

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

Multiwinner Voting with Interval Preferences under Incomplete Information
by: Springham, Drew, et al.
Published: (2025)

On the Potential and Limitations of Proxy Voting: Delegation with Incomplete Votes
by: Amanatidis, Georgios, et al.
Published: (2023)

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

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

Envy-Free Cake-Cutting for Four Agents
by: Hollender, Alexandros, et al.
Published: (2023)

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

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

Constant Inapproximability for Fisher Markets
by: Deligkas, Argyrios, et al.
Published: (2026)

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

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

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

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

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

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

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

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

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

Constant Inapproximability for PPA
by: Deligkas, Argyrios, et al.
Published: (2022)

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

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

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

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

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

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

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

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

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

Equilibrium and Selfish Behavior in Network Contagion
by: Zhang, Yi, et al.
Published: (2025)

Equilibrium Computation in First-Price Auctions with Correlated Priors
by: Filos-Ratsikas, Aris, et al.
Published: (2025)

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