Collective decision making
From MaRDI portal
Publication:6602233
Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Decision theory (91B06) Auctions, bargaining, bidding and selling, and other market models (91B26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Agent technology and artificial intelligence (68T42) Voting theory (91B12)
Recommendations
Cites work
- scientific article; zbMATH DE number 5485443 (Why is no real title available?)
- scientific article; zbMATH DE number 1015852 (Why is no real title available?)
- A Set of Independent Necessary and Sufficient Conditions for Simple Majority Decision
- A note on ``Bank winners in tournaments are difficult to recognize by G. J. Woeginger
- Algorithm for optimal winner determination in combinatorial auctions
- An Envy-Free Cake Division Protocol
- Approximability of Dodgson's rule
- Approximation algorithms for computing maximin share allocations
- Banks winners in tournaments are difficult to recognize
- Better ways to cut a cake
- Characterization and computation of equilibria for indivisible goods
- Combinatorial auctions. Foreword by Vernon L. Smith.
- Competitive equilibrium with equal incomes for allocation of indivisible objects
- Computationally manageable combinational auctions
- Computing leximin-optimal solutions in constraint networks
- Control and bribery in voting
- Distributed fair allocation of indivisible goods
- Efficiency and envy-freeness in fair division of indivisible goods: logical representation and complexity
- Exact analysis of Dodgson elections
- Exact complexity of the winner problem for Young elections
- Fair assignment of indivisible objects under ordinal preferences
- Handbook of Computational Social Choice
- Handbook on approval voting
- How hard is it to control an election?
- Incomplete information and communication in voting
- Introduction to the theory of voting
- Junta distributions and the average-case complexity of manipulating elections
- Manipulation of Voting Schemes: A General Result
- Maximizing the minimum voter satisfaction on spanning trees
- On Equitable Resource Allocation Problems: A Lexicographic Minimax Approach
- On ordered weighted averaging aggregation operators in multicriteria decisionmaking
- On the approximability of Dodgson and Young elections
- On the lexicographic minimax approach to location problems
- Ranking Tournaments
- Rationalizations of Voting Rules
- Sequential composition of voting rules in multi-issue domains
- Single transferable vote resists strategic voting
- Strategy-proofness and Arrow's conditions: existence and correspondence theorems for voting procedures and social welfare functions
- The Santa Claus problem
- The complexity of contract negotiation
- The computational difficulty of manipulating an election
- The paradox of multiple elections
- The traveling group problem
- Tournament solutions
- Voting in combinatorial domains
- Voting schemes for which it can be difficult to tell who won the election
- Weighted tournament solutions
This page was built for publication: Collective decision making
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6602233)
