Collective decision making
From MaRDI portal
Publication:6602233
DOI10.1007/978-3-030-06164-7_18zbMath1547.68757MaRDI QIDQ6602233
Michel Lemaître, Sylvain Bouveret, Jérôme Lang
Publication date: 11 September 2024
Decision theory (91B06) Voting theory (91B12) Auctions, bargaining, bidding and selling, and other market models (91B26) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Agent technology and artificial intelligence (68T42)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Distributed fair allocation of indivisible goods
- Handbook on approval voting
- Maximizing the minimum voter satisfaction on spanning trees
- Computing leximin-optimal solutions in constraint networks
- Fair assignment of indivisible objects under ordinal preferences
- Approximability of Dodgson's rule
- Sequential composition of voting rules in multi-issue domains
- Voting schemes for which it can be difficult to tell who won the election
- Single transferable vote resists strategic voting
- How hard is it to control an election?
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- On the lexicographic minimax approach to location problems
- Exact complexity of the winner problem for Young elections
- A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger
- Competitive equilibrium with equal incomes for allocation of indivisible objects
- The computational difficulty of manipulating an election
- The traveling group problem
- The paradox of multiple elections
- The complexity of contract negotiation
- Banks winners in tournaments are difficult to recognize
- Computationally Manageable Combinational Auctions
- The Santa Claus problem
- Approximation Algorithms for Computing Maximin Share Allocations
- Characterization and Computation of Equilibria for Indivisible Goods
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- Manipulation of Voting Schemes: A General Result
- Exact analysis of Dodgson elections
- On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach
- An Envy-Free Cake Division Protocol
- Introduction to the Theory of Voting
- Tournament Solutions
- Weighted Tournament Solutions
- Control and Bribery in Voting
- Rationalizations of Voting Rules
- Voting in Combinatorial Domains
- Incomplete Information and Communication in Voting
- Handbook of Computational Social Choice
- Ranking Tournaments
- A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision
- Algorithm for optimal winner determination in combinatorial auctions
This page was built for publication: Collective decision making
