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)

Taxonomy of powerful voters and manipulation in the framework of social choice functions ⋮ Public Bayesian persuasion: being almost optimal and almost persuasive ⋮ A unifying rank aggregation framework to suitably and efficiently aggregate any kind of rankings ⋮ Characterizing the top cycle via strategyproofness ⋮ On weakly and strongly popular rankings ⋮ Fair ride allocation on a line ⋮ Collective schedules: axioms and algorithms ⋮ Fairness in temporal slot assignment ⋮ Strategic behaviour and manipulation resistance in peer-to-peer, crowdsourced information gathering ⋮ Possible and necessary winner problems in iterative elections with multiple rules ⋮ Hardness and algorithms for electoral manipulation under media influence ⋮ Hotelling-Downs equilibria: moving beyond plurality variants ⋮ The possible winner with uncertain weights problem ⋮ On existence of truthful fair cake cutting mechanisms ⋮ Approximate Condorcet partitioning: solving large-scale rank aggregation problems ⋮ Top-\(k\) list aggregation: mathematical formulations and polyhedral comparisons ⋮ Tight bounds on 3-team manipulations in randomized death match ⋮ Auditing for core stability in participatory budgeting ⋮ Beyond the worst case: semi-random complexity analysis of winner determination ⋮ Heuristics for opinion diffusion via local elections ⋮ Resilient heuristic aggregation of judgments in the pairwise comparisons method ⋮ Negotiation strategies for agents with ordinal preferences: theoretical analysis and human study ⋮ An axiomatic distance methodology for aggregating multimodal evaluations ⋮ Optimal Mechanism Design for Agents with DSL Strategies: The Case of Sybil Attacks in Combinatorial Auctions ⋮ Maximizing Social Welfare in Score-Based Social Distance Games ⋮ Truthful ownership transfer with expert advice ⋮ Diverse Pairs of Matchings ⋮ Impartial selection with additive approximation guarantees ⋮ Robust bounds on choosing from large tournaments ⋮ Robust bounds on choosing from large tournaments ⋮ 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

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