Pages that link to "Item:Q5448765"

The following pages link to A Short Introduction to Computational Social Choice (Q5448765):

Displaying 28 items.

• Link prediction in multiplex networks (Q258449) (← links)
• The logic of group decisions: judgment aggregation (Q266657) (← links)
• Portfolio approaches for constraint optimization problems (Q276552) (← links)
• Manipulation complexity of same-system runoff elections (Q314418) (← links)
• Solving hard control problems in voting systems via integer programming (Q322433) (← links)
• Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
• Fair resource allocation for different scenarios of demands (Q439500) (← links)
• The consequences of eliminating NP solutions (Q458458) (← links)
• Joint desirability foundations of social choice and opinion pooling (Q824994) (← links)
• Parameterized complexity of candidate control in elections and related digraph problems (Q1040585) (← links)
• On the product knapsack problem (Q1653266) (← links)
• Towards a dichotomy for the possible winner problem in elections based on scoring rules (Q1959429) (← links)
• Chained correlations for feature selection (Q2022496) (← links)
• Exploiting social influence to control elections based on positional scoring rules (Q2105422) (← links)
• Privacy stochastic games in distributed constraint reasoning (Q2202511) (← links)
• Control complexity in Borda elections: solving all open cases of offline control and some cases of online control (Q2238692) (← links)
• Parameterized computational complexity of Dodgson and Young elections (Q2266990) (← links)
• Preference elicitation and robust winner determination for single- and multi-winner social choice (Q2287202) (← links)
• Explanation in artificial intelligence: insights from the social sciences (Q2321252) (← links)
• Inferring bi-directional interactions between circadian clock genes and metabolism with model ensembles (Q2344256) (← links)
• Worst case compromises in matroids with applications to the allocation of indivisible goods (Q2346382) (← links)
• Lifting integrity constraints in binary aggregation (Q2446586) (← links)
• Studies in Computational Aspects of Voting (Q2908543) (← links)
• Representing Utility Functions via Weighted Goals (Q3392304) (← links)
• Parameterized Computational Complexity of Dodgson and Young Elections (Q3512476) (← links)
• Voting in Combinatorial Domains: What Logic and AI Have to Say (Q3532453) (← links)
• (Q4998871) (← links)
• Voting Procedures, Complexity of (Q5150301) (← links)