Pages that link to "Item:Q5228018"
From MaRDI portal
The following pages link to Handbook of Computational Social Choice (Q5228018):
Displayed 50 items.
- A Borda count for collective sentiment analysis (Q314431) (← links)
- Prices matter for the parameterized complexity of shift bribery (Q342714) (← links)
- Graph aggregation (Q514143) (← links)
- Path-disruption games: bribery and a probabilistic model (Q519896) (← links)
- On the complexity of reasoning about opinion diffusion under majority dynamics (Q785234) (← links)
- Extending tournament solutions (Q1616754) (← links)
- How to cut a cake with a Gram matrix (Q1625485) (← links)
- Manipulative elicitation -- a new attack on elections with incomplete preferences (Q1637215) (← links)
- Optimal defense against election control by deleting voter groups (Q1647508) (← links)
- Monotonicity-based consensus states for the monometric rationalisation of ranking rules and how they are affected by ties (Q1679657) (← links)
- Optimal bounds for the no-show paradox via SAT solving (Q1680092) (← links)
- On the structure of stable tournament solutions (Q1707316) (← links)
- Analyzing power in weighted voting games with super-increasing weights (Q1733386) (← links)
- Complexity of manipulation with partial information in voting (Q1743720) (← links)
- Building fences straight and high: an optimal algorithm for finding the maximum length you can cut \(k\) times from given sticks (Q1755749) (← links)
- On the existence of Pareto efficient and envy-free allocations (Q2025008) (← links)
- A parameterized perspective on protecting elections (Q2034407) (← links)
- A brief history of social choice and welfare theory (Q2064124) (← links)
- Gabrielle Demange (Q2064131) (← links)
- Complexity of shift bribery for iterative voting rules (Q2095550) (← links)
- Structural control in weighted voting games (Q2098945) (← links)
- Reducing the time required to find the Kemeny ranking by exploiting a necessary condition for being a winner (Q2103031) (← links)
- Exploiting social influence to control elections based on positional scoring rules (Q2105422) (← links)
- The complexity of online bribery in sequential elections (Q2121471) (← links)
- Merging existential rules programs in multi-agent contexts through credibility accrual (Q2124187) (← links)
- The possible winner problem with uncertain weights revisited (Q2140520) (← links)
- Controlling weighted voting games by deleting or adding players with or without changing the quota (Q2169970) (← links)
- Towards Copeland optimization in combinatorial problems (Q2170176) (← links)
- Cycles in synchronous iterative voting: general robustness and examples in approval voting (Q2171865) (← links)
- Weighted representative democracy (Q2178584) (← links)
- The expanding approvals rule: improving proportional representation and monotonicity (Q2179446) (← links)
- A new correlation coefficient for comparing and aggregating non-strict and incomplete rankings (Q2184062) (← links)
- Complexity of control in judgment aggregation for uniform premise-based quota rules (Q2186810) (← links)
- Byzantine preferential voting (Q2190409) (← links)
- Multiple birds with one stone: beating 1/2 for EFX and GMMS via envy cycle elimination (Q2202022) (← links)
- Privacy stochastic games in distributed constraint reasoning (Q2202511) (← links)
- An approach for combining ethical principles with public opinion to guide public policy (Q2211866) (← links)
- Neutrality and relative acceptability in judgment aggregation (Q2217346) (← links)
- Network reliability in Hamiltonian graphs (Q2234742) (← links)
- Predicting winner and estimating margin of victory in elections using sampling (Q2238579) (← links)
- The solution of generalized stable sets and its refinement (Q2243513) (← links)
- Solidarity and efficiency in preference aggregation: a tale of two rules (Q2278916) (← links)
- Preference elicitation and robust winner determination for single- and multi-winner social choice (Q2287202) (← links)
- From iterated revision to iterated contraction: extending the Harper identity (Q2289014) (← links)
- On the parameterized complexity of party nominations (Q2290374) (← links)
- Practical reasoning using values: an argumentative approach based on a hierarchy of values (Q2294587) (← links)
- Mixed integer programming with convex/concave constraints: fixed-parameter tractability and applications to multicovering and voting (Q2304553) (← links)
- On dynamic aggregation systems (Q2307734) (← links)
- Stable matchings with covering constraints: a complete computational trichotomy (Q2309466) (← links)
- \(k\)-majority digraphs and the hardness of voting with a constant number of voters (Q2316935) (← links)