More effort towards multiagent knapsack

DOI10.1007/978-3-031-23101-8_4zbMath1529.91035arXiv2208.02766OpenAlexW4313429573MaRDI QIDQ6169510

Sushmita Gupta, Pallavi Jain, Sanjay Seetharaman

Publication date: 14 August 2023

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2208.02766

zbMATH Keywords

complexityvotingsocial choice

Mathematics Subject Classification ID

Social choice (91B14) Parameterized complexity, tractability and kernelization (68Q27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Finding a collective set of items: from proportional multirepresentation to group recommendation
• Fundamentals of parameterized complexity
• Voting almost maximizes social welfare despite limited communication
• Approximating optimal social choice under metric preferences
• Exact and approximate bandwidth
• Optimal social choice functions: a utilitarian view
• A note on maximizing a submodular set function subject to a knapsack constraint
• Axiomatic characterization of committee scoring rules
• Properties of multiwinner voting rules
• Gerrymandering on graphs: computational complexity and parameterized algorithms
• Randomized Social Choice Functions Under Metric Preferences
• Parameterized Algorithms

This page was built for publication: More effort towards multiagent knapsack