Handbook of Computational Social Choice

DOI10.1017/CBO9781107446984zbMath1436.91001OpenAlexW4296288933MaRDI QIDQ5228018

No author found.

Publication date: 8 August 2019

Full work available at URL: https://doi.org/10.1017/cbo9781107446984

Cooperative games (91A12) Voting theory (91B12) Computational methods for problems pertaining to game theory, economics, and finance (91-08) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Social choice (91B14) General reference works (handbooks, dictionaries, bibliographies, etc.) pertaining to game theory, economics, and finance (91-00)

Related Items (only showing first 100 items - show all)

Cutting a Cake Fairly for Groups Revisited ⋮ The complexity of online bribery in sequential elections ⋮ Extending tournament solutions ⋮ Merging existential rules programs in multi-agent contexts through credibility accrual ⋮ Tennis manipulation: can we help Serena Williams win another tournament? Or can we control a knockout tournament with reasonable complexity? ⋮ Isomorphic Distances Among Elections ⋮ How to cut a cake with a Gram matrix ⋮ Condorcet-consistent and approximately strategyproof tournament rules ⋮ Analyzing the Practical Relevance of the Condorcet Loser Paradox and the Agenda Contraction Paradox ⋮ Exploring the No-Show Paradox for Condorcet Extensions ⋮ The possible winner problem with uncertain weights revisited ⋮ Manipulative elicitation -- a new attack on elections with incomplete preferences ⋮ A refinement of the uncovered set in tournaments ⋮ A Borda count for collective sentiment analysis ⋮ Optimal defense against election control by deleting voter groups ⋮ Prices matter for the parameterized complexity of shift bribery ⋮ On the Indecisiveness of Kelly-Strategyproof Social Choice Functions ⋮ Controlling weighted voting games by deleting or adding players with or without changing the quota ⋮ Towards Copeland optimization in combinatorial problems ⋮ The composite iteration algorithm for finding efficient and financially fair risk-sharing rules ⋮ Cycles in synchronous iterative voting: general robustness and examples in approval voting ⋮ Efficiency and equity in the multi organization scheduling problem ⋮ Weighted representative democracy ⋮ Complexity results for preference aggregation over \((m)\)CP-nets: max and rank voting ⋮ The expanding approvals rule: improving proportional representation and monotonicity ⋮ Monotonicity-based consensus states for the monometric rationalisation of ranking rules and how they are affected by ties ⋮ Voting: a machine learning approach ⋮ Optimal bounds for the no-show paradox via SAT solving ⋮ Hedonic expertise games ⋮ When dividing mixed manna is easier than dividing goods: competitive equilibria with a constant number of chores ⋮ Efficient Fair Division with Minimal Sharing ⋮ A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings ⋮ Verified Construction of Fair Voting Rules ⋮ Complexity of control in judgment aggregation for uniform premise-based quota rules ⋮ Byzantine preferential voting ⋮ Almost Envy-Freeness with General Valuations ⋮ Agreeable sets with matroidal constraints ⋮ Unnamed Item ⋮ Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination ⋮ Privacy stochastic games in distributed constraint reasoning ⋮ Aggregating preferences represented by conditional preference networks ⋮ Preference aggregation in the generalised unavailable candidate model ⋮ In the beginning there were \(n\) agents: founding and amending a constitution ⋮ Iterative deliberation via metric aggregation ⋮ Democratic forking: choosing sides with social choice ⋮ Hedonic diversity games revisited ⋮ Bribery in voting with CP-nets ⋮ On the structure of stable tournament solutions ⋮ On the exact amount of missing information that makes finding possible winners hard ⋮ An approach for combining ethical principles with public opinion to guide public policy ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Neutrality and relative acceptability in judgment aggregation ⋮ The Complexity Landscape of Outcome Determination in Judgment Aggregation ⋮ Toward Computing the Margin of Victory in Single Transferable Vote Elections ⋮ Analyzing power in weighted voting games with super-increasing weights ⋮ Network reliability in Hamiltonian graphs ⋮ Fair Division ⋮ Predicting winner and estimating margin of victory in elections using sampling ⋮ Complexity of manipulation with partial information in voting ⋮ The solution of generalized stable sets and its refinement ⋮ Graph aggregation ⋮ Path-disruption games: bribery and a probabilistic model ⋮ Building fences straight and high: an optimal algorithm for finding the maximum length you can cut \(k\) times from given sticks ⋮ Gabrielle Demange ⋮ On the existence of Pareto efficient and envy-free allocations ⋮ Unnamed Item ⋮ Solidarity and efficiency in preference aggregation: a tale of two rules ⋮ A parameterized perspective on protecting elections ⋮ Preference elicitation and robust winner determination for single- and multi-winner social choice ⋮ From iterated revision to iterated contraction: extending the Harper identity ⋮ On the parameterized complexity of party nominations ⋮ Balanced stable marriage: how close is close enough? ⋮ Practical reasoning using values: an argumentative approach based on a hierarchy of values ⋮ Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting ⋮ On dynamic aggregation systems ⋮ Stable matchings with covering constraints: a complete computational trichotomy ⋮ A brief history of social choice and welfare theory ⋮ \(k\)-majority digraphs and the hardness of voting with a constant number of voters ⋮ Parameterized dichotomy of choosing committees based on approval votes in the presence of outliers ⋮ Aggregation over Metric Spaces: Proposing and Voting in Elections, Budgeting, and Legislation ⋮ Optimizing positional scoring rules for rank aggregation ⋮ Preservation of semantic properties in collective argumentation: the case of aggregating abstract argumentation frameworks ⋮ Complexity results for preference aggregation over (\(m\))CP-nets: Pareto and majority voting ⋮ Empathetic decision making in social networks ⋮ Competitive Equilibrium with Indivisible Goods and Generic Budgets ⋮ On the Exact Amount of Missing Information that Makes Finding Possible Winners Hard ⋮ On the complexity of reasoning about opinion diffusion under majority dynamics ⋮ Controlling sub-tournaments: easy or hard problem? Theoretical vs. practical analysis ⋮ Social Choice Theory ⋮ Fully Polynomial-Time Approximation Schemes for Fair Rent Division ⋮ Liquid Democracy: An Algorithmic Perspective ⋮ Complexity of shift bribery for iterative voting rules ⋮ Structural control in weighted voting games ⋮ Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner ⋮ Exploiting social influence to control elections based on positional scoring rules ⋮ A New Binary Programming Formulation and Social Choice Property for Kemeny Rank Aggregation ⋮ Fair Cake Division Under Monotone Likelihood Ratios ⋮ Nash Social Welfare Approximation for Strategic Agents

This page was built for publication: Handbook of Computational Social Choice