scientific article; zbMATH DE number 7450032
From MaRDI portal
Publication:5018515
Hemaspaandra, Lane A., Jörg Rothe, Edith Hemaspaandra
Publication date: 20 December 2021
Full work available at URL: https://arxiv.org/abs/1907.09108
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Related Items (2)
Cites Work
- Unnamed Item
- Unnamed Item
- Economics and computation. An introduction to algorithmic game theory, computational social choice, and fair division
- Prices matter for the parameterized complexity of shift bribery
- New candidates welcome! Possible winners with respect to the addition of new candidates
- The complexity of controlling candidate-sequential elections
- Algorithms for the coalitional manipulation problem
- A low and a high hierarchy within NP
- Reductions on NP and p-selective sets
- The theory of voting and equilibria in noncooperative games
- A comparison of polynomial time reducibilities
- The polynomial-time hierarchy
- The computational difficulty of manipulating an election
- The complexity of online manipulation of sequential elections
- When are elections with few candidates hard to manipulate?
- How Hard Is Bribery in Elections?
- Complexity Measures for Public-Key Cryptosystems
- Alternation
- Exact analysis of Dodgson elections
- Handbook of Computational Social Choice
This page was built for publication:
