A Short Introduction to Computational Social Choice
From MaRDI portal
Publication:5448765
DOI10.1007/978-3-540-69507-3_4zbMath1131.91316OpenAlexW2107392942MaRDI QIDQ5448765
Nicolas Maudet, Yann Chevaleyre, Jérôme Lang, Ulle Endriss
Publication date: 7 March 2008
Published in: Lecture Notes in Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-540-69507-3_4
Related Items (28)
The logic of group decisions: judgment aggregation ⋮ Joint desirability foundations of social choice and opinion pooling ⋮ Portfolio approaches for constraint optimization problems ⋮ Manipulation complexity of same-system runoff elections ⋮ Studies in Computational Aspects of Voting ⋮ Solving hard control problems in voting systems via integer programming ⋮ On the product knapsack problem ⋮ Prices matter for the parameterized complexity of shift bribery ⋮ Unnamed Item ⋮ Parameterized Computational Complexity of Dodgson and Young Elections ⋮ Privacy stochastic games in distributed constraint reasoning ⋮ Fair resource allocation for different scenarios of demands ⋮ Towards a dichotomy for the possible winner problem in elections based on scoring rules ⋮ Voting in Combinatorial Domains: What Logic and AI Have to Say ⋮ The consequences of eliminating NP solutions ⋮ Lifting integrity constraints in binary aggregation ⋮ Voting Procedures, Complexity of ⋮ Control complexity in Borda elections: solving all open cases of offline control and some cases of online control ⋮ Parameterized computational complexity of Dodgson and Young elections ⋮ Chained correlations for feature selection ⋮ Preference elicitation and robust winner determination for single- and multi-winner social choice ⋮ Representing Utility Functions via Weighted Goals ⋮ Explanation in artificial intelligence: insights from the social sciences ⋮ Parameterized complexity of candidate control in elections and related digraph problems ⋮ Inferring bi-directional interactions between circadian clock genes and metabolism with model ensembles ⋮ Worst case compromises in matroids with applications to the allocation of indivisible goods ⋮ Exploiting social influence to control elections based on positional scoring rules ⋮ Link prediction in multiplex networks
This page was built for publication: A Short Introduction to Computational Social Choice
