On the public citation graph

Sequential composition of voting rules in multi-issue domains

https://doi.org/10.1016/j.mathsocsci.2008.12.010
0 signed · 107 inferred · view as graph

Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.

Is this your work? Sign in with ORCID and put your name on the claims that are yours.
Claim with ORCID
Reference health. See whether every reference in this work resolves to a known work and none has been retracted — and get a dated CiteStamped badge you can embed.
See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/bf00179100openalex-snapshot
Composition-consistent tournament solutions and social choice functions
inferredcites →https://doi.org/10.1007/s00355-006-0101-7openalex-snapshot
Ensuring Pareto Optimality by Referendum Voting
inferredcites →https://doi.org/10.1007/s003550050101openalex-snapshot
The paradox of multiple elections
inferredcites →https://doi.org/10.1007/s003550050102openalex-snapshot
A strong paradox of multiple elections
inferredcites →https://doi.org/10.1016/j.mathsocsci.2004.08.006openalex-snapshot
Separable discrete preferences
inferredcites →https://doi.org/10.1016/j.mathsocsci.2007.07.005openalex-snapshot
Classifying interdependence in multidimensional binary preferences
inferredcites →https://doi.org/10.1016/s0261-3794(97)00015-2openalex-snapshot
Voting on referenda: the separability problem and possible solutions
inferredcites →https://doi.org/10.1017/ccol052123736x.010openalex-snapshot
Topological methods in cardinal utility theory
inferredcites →https://doi.org/10.1017/s0003055401002210openalex-snapshot
The Sum of the Parts Can Violate the Whole
inferredcites →https://doi.org/10.1023/b:amai.0000034522.25580.09openalex-snapshot
Logical Preference Representation and Combinatorial Vote
inferredcites →https://doi.org/10.1111/1468-0262.00038openalex-snapshot
Separable Preferences, Strategyproofness, and Decomposability
inferredcites →https://doi.org/10.1111/j.0824-7935.2004.00234.xopenalex-snapshot
Preference‐Based Constrained Optimization with CP‐Nets
inferredcites →https://doi.org/10.1145/1324249.1324286openalex-snapshot
Sequential voting rules and multiple elections paradoxes
inferredcites →https://doi.org/10.1177/0951692800012001001openalex-snapshot
A Problem with Referendums
inferredcites →https://doi.org/10.1613/jair.1234openalex-snapshot
CP-nets: A Tool for Representing and Reasoning withConditional Ceteris Paribus Preference Statements
inferredcites →https://doi.org/10.2139/ssrn.954698openalex-snapshot
Only a Dictatorship is Efficient or Neutral
inferredcites →https://doi.org/10.2307/1420161openalex-snapshot
Mathematical Methods in the Social Sciences
inferredcites →https://doi.org/10.2307/2296766openalex-snapshot
The Structure of Utility Functions
inferredcites →https://doi.org/10.2307/2584151openalex-snapshot
Decisions with Multiple Objectives: Preferences and Value Tradeoffs.
inferredcites →https://doi.org/10.2307/2944890openalex-snapshot
Social Choice in a Representative Democracy

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.2139/ssrn.4640092openalex-extracted
On the Complexity of Winner Determination and Strategic Control in Conditional Approval Voting
inferred← citeshttps://doi.org/10.1007/978-1-4939-3094-4_3openalex-snapshot
Preference Modelling
inferred← citeshttps://doi.org/10.1007/978-3-030-02925-8_11openalex-snapshot
A CP-Net Based Qualitative Composition Approach for an IaaS Provider
inferred← citeshttps://doi.org/10.1007/978-3-030-06164-7_18openalex-snapshot
Collective Decision Making
inferred← citeshttps://doi.org/10.1007/978-3-030-57980-7_18openalex-snapshot
Line-Up Elections: Parallel Voting with Shared Candidate Pool
inferred← citeshttps://doi.org/10.1007/978-3-030-87756-9_1openalex-snapshot
Aggregating Preferences Represented by Conditional Preference Networks
inferred← citeshttps://doi.org/10.1007/978-3-031-53966-4_28openalex-snapshot
Decision-Making over Compact Preference Structures
inferred← citeshttps://doi.org/10.1007/978-3-319-10428-7_28openalex-snapshot
Aggregating CP-nets with Unfeasible Outcomes
inferred← citeshttps://doi.org/10.1007/978-3-319-23114-3_33openalex-snapshot
CP-nets: From Theory to Practice
inferred← citeshttps://doi.org/10.1007/978-3-319-33810-1_8openalex-snapshot
A Design of Context-Aware Framework for Conditional Preferences of Group of Users
inferred← citeshttps://doi.org/10.1007/978-3-319-45856-4_6openalex-snapshot
Incremental Preference Elicitation in Multi-attribute Domains for Choice and Ranking with the Borda Count
inferred← citeshttps://doi.org/10.1007/978-3-319-49130-1_19openalex-snapshot
A Self-Adaptive Context-Aware Group Recommender System
inferred← citeshttps://doi.org/10.1007/978-3-319-90050-6_16openalex-snapshot
Preference Learning and Optimization for Partial Lexicographic Preference Forests over Combinatorial Domains
inferred← citeshttps://doi.org/10.1007/978-3-642-02839-7_7openalex-snapshot
Does Choosing Committees from Approval Balloting Fulfill the Electorate’s Will?
inferred← citeshttps://doi.org/10.1007/978-3-642-04428-1_4openalex-snapshot
Iterated Majority Voting
inferred← citeshttps://doi.org/10.1007/978-3-642-14197-3_3openalex-snapshot
Graphical Representation of Ordinal Preferences: Languages and Applications
inferred← citeshttps://doi.org/10.1007/978-3-642-17432-2_38openalex-snapshot
An Efficient Approach for Ordering Outcomes and Making Social Choices with CP-Nets
inferred← citeshttps://doi.org/10.1007/978-3-642-17572-5_33openalex-snapshot
Strategy-Proof Voting Rules over Multi-issue Domains with Restricted Preferences
inferred← citeshttps://doi.org/10.1007/978-3-642-33558-7_69openalex-snapshot
Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains
inferred← citeshttps://doi.org/10.1007/978-3-642-36976-6_1openalex-snapshot
Computational Social Choice (with a Special Emphasis on the Use of Logic)
inferred← citeshttps://doi.org/10.1007/978-981-92-2862-1_27openalex-snapshot
Ranked Convictions: Multi-agent Qualitative Preference Reasoning
inferred← citeshttps://doi.org/10.1007/s00355-022-01436-0openalex-snapshot
Voting behavior in one-shot and iterative multiple referenda
inferred← citeshttps://doi.org/10.1007/s10458-018-09400-yopenalex-snapshot
Multi-agent soft constraint aggregation via sequential voting: theoretical and experimental results
inferred← citeshttps://doi.org/10.1007/s10472-013-9330-5openalex-snapshot
Bribery in voting with CP-nets
inferred← citeshttps://doi.org/10.1007/s10472-013-9358-6openalex-snapshot
Approximately classic judgement aggregation
inferred← citeshttps://doi.org/10.1007/s10472-015-9469-3openalex-snapshot
On the hardness of bribery variants in voting with CP-nets
inferred← citeshttps://doi.org/10.1007/s10472-019-09645-7openalex-snapshot
Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains
inferred← citeshttps://doi.org/10.1007/s10601-013-9153-3openalex-snapshot
Collective decision making: a great opportunity for constraint reasoning
inferred← citeshttps://doi.org/10.1007/s10732-014-9246-1openalex-snapshot
A distributed social choice protocol for combinatorial domains
inferred← citeshttps://doi.org/10.1007/s10732-014-9276-8openalex-snapshot
Aggregating multi-valued CP-nets: a CSP-based approach
inferred← citeshttps://doi.org/10.1007/s11238-025-10098-0openalex-snapshot
Jérôme Lang’s contributions at the interface of economic theory with artificial intelligence
inferred← citeshttps://doi.org/10.1016/j.artint.2010.07.003openalex-snapshot
Compactly representing utility functions using weighted goals and the max aggregator
inferred← citeshttps://doi.org/10.1016/j.artint.2013.05.001openalex-snapshot
Lifting integrity constraints in binary aggregation
inferred← citeshttps://doi.org/10.1016/j.artint.2018.05.004openalex-snapshot
Voting on multi-issue domains with conditionally lexicographic preferences
inferred← citeshttps://doi.org/10.1016/j.artint.2018.12.010openalex-snapshot
Complexity results for preference aggregation over (m)CP-nets: Pareto and majority voting
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103636openalex-snapshot
Complexity results for preference aggregation over (m)CP-nets: Max and rank voting
inferred← citeshttps://doi.org/10.1016/j.ejor.2010.05.009openalex-snapshot
Making choices with a binary relation: Relative choice axioms and transitive closures
inferred← citeshttps://doi.org/10.1016/j.geb.2018.08.005openalex-snapshot
Bidding games and efficient allocations
inferred← citeshttps://doi.org/10.1016/j.tcs.2025.115396openalex-snapshot
On the complexity of winner determination and strategic control in conditional approval voting
inferred← citeshttps://doi.org/10.1080/23307706.2021.1885509openalex-snapshot
The evaluation of voting rules based on voting networks: Weber problem with support domain
inferred← citeshttps://doi.org/10.1109/access.2021.3114637openalex-snapshot
Conditional Preference Networks for Cloud Service Selection and Ranking With Many Irrelevant Attributes
inferred← citeshttps://doi.org/10.1145/1993574.1993602openalex-snapshot
Strategic sequential voting in multi-issue domains and multiple-election paradoxes
inferred← citeshttps://doi.org/10.1145/2764468.2764526openalex-snapshot
Bidding Games and Efficient Allocations
inferred← citeshttps://doi.org/10.1145/3278721.3278723openalex-snapshot
Preferences and Ethical Principles in Decision Making
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8586openalex-snapshot
Bribery in Voting With Soft Constraints
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8639openalex-snapshot
A Framework for Aggregating Influenced CP-Nets and its Resistance to Bribery
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9308openalex-snapshot
Approximating Optimal Social Choice under Metric Preferences
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10115openalex-snapshot
Generating CP-Nets Uniformly at Random
inferred← citeshttps://doi.org/10.1609/aaai.v34i02.5584openalex-snapshot
Perpetual Voting: Fairness in Long-Term Decision Making
inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25710openalex-snapshot
Proportional Decisions in Perpetual Voting
inferred← citeshttps://doi.org/10.1609/aaai.v38i9.28911openalex-snapshot
Approximation Algorithms for Preference Aggregation Using CP-Nets
inferred← citeshttps://doi.org/10.1613/jair.1.13009openalex-snapshot
Reasoning with PCP-Nets
inferred← citeshttps://doi.org/10.1613/jair.3186openalex-snapshot
Determining Possible and Necessary Winners Given Partial Orders
inferred← citeshttps://doi.org/10.1613/jair.5455openalex-snapshot
Uniform Random Generation and Dominance Testing for CP-Nets
inferred← citeshttps://doi.org/10.2200/s00372ed1v01y201107aim014openalex-snapshot
A Short Introduction to Preferences: Between Artificial Intelligence and Social Choice
inferred← citeshttps://doi.org/10.24963/ijcai.2020/43openalex-snapshot
Computational Aspects of Conditional Minisum Approval Voting in Elections with Interdependent Issues
inferred← citeshttps://doi.org/10.24963/ijcai.2023/310openalex-snapshot
Convergence in Multi-Issue Iterative Voting under Uncertainty
inferred← citeshttps://doi.org/10.25916/sut.26223890openalex-snapshot
An efficient majority-rule-based approach for collective decision making with CP-nets
inferred← citeshttps://doi.org/10.31235/osf.io/y4m6ropenalex-snapshot
Voting behavior in one-shot and iterative multiple referenda
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-375openalex-snapshot
An Efficient Procedure for Collective Decision-making with CP-nets
inferred← citeshttps://doi.org/10.3233/978-1-61499-098-7-528openalex-snapshot
Choosing Combinatorial Social Choice by Heuristic Search
inferred← citeshttps://doi.org/10.4169/math.mag.84.4.268openalex-snapshot
The Mathematics of Referendum Elections and Separable Preferences
inferred← citeshttps://doi.org/10.48550/arxiv.1202.3740openalex-snapshot
An Efficient Protocol for Negotiation over Combinatorial Domains with Incomplete Information
inferred← citeshttps://doi.org/10.48550/arxiv.1204.1231openalex-snapshot
How Many Vote Operations Are Needed to Manipulate A Voting System?
inferred← citeshttps://doi.org/10.48550/arxiv.1309.6864openalex-snapshot
Preference Elicitation For General Random Utility Models
inferred← citeshttps://doi.org/10.48550/arxiv.1406.2855openalex-snapshot
The Common Structure of Paradoxes in Aggregation Theory
inferred← citeshttps://doi.org/10.48550/arxiv.1901.10064openalex-snapshot
Committee Selection with Attribute Level Preferences
inferred← citeshttps://doi.org/10.48550/arxiv.2102.12221openalex-snapshot
A CP-Net based Qualitative Composition Approach for an IaaS Provider
inferred← citeshttps://doi.org/10.5220/0003156602770282openalex-snapshot
MULTI-AGENT SOFT CONSTRAINT AGGREGATION - A Sequential Approach
inferred← citeshttps://doi.org/10.5555/1838206.1838262openalex-snapshot
[Chancre-paronychia in a patient with secondary early syphilis].
inferred← citeshttps://doi.org/10.5555/1838206.1838527openalex-snapshot
On efficient mediation approach to multi-issue negotiation with optimal and fair outcomes
inferred← citeshttps://doi.org/10.5555/2031678.2031711openalex-snapshot
Majority-rule-based preference aggregation on multi-attribute domains with CP-nets
inferred← citeshttps://doi.org/10.5555/2343896.2344031openalex-snapshot
Bribery in voting over combinatorial domains is easy
inferred← citeshttps://doi.org/10.5555/2484920.2484995openalex-snapshot
Designing social choice mechanisms using machine learning
inferred← citeshttps://doi.org/10.5555/2484920.2485099openalex-snapshot
A distributed protocol for collective decision-making in combinatorial domains
inferred← citeshttps://doi.org/10.5555/2484920.2485194openalex-snapshot
Resistance to bribery when aggregating soft constraints
inferred← citeshttps://doi.org/10.5555/2772879.2773276openalex-snapshot
Reasoning with PCP-nets in a Multi-Agent Context
inferred← citeshttps://doi.org/10.5555/3091125.3091422openalex-snapshot
Optimal Decision Making with CP-nets and PCP-nets
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-015openalex-snapshot
Aggregating Dependency Graphs into Voting Agendas in Multi-Issue Elections
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-040openalex-snapshot
Multi-agent soft constraint aggregation via sequential voting
inferred← citeshttps://doi.org/10.5591/978-1-57735-516-8/ijcai11-045openalex-snapshot
Binary Aggregation with Integrity Constraints
inferred← citeshttps://doi.org/10.65109/ctif3759openalex-snapshot
Influence and aggregation of preferences over combinatorial domains
inferred← citeshttps://doi.org/10.65109/ehew9087openalex-snapshot
Strategic voting and the logic of knowledge
inferred← citeshttps://doi.org/10.65109/udhc6112openalex-snapshot
More Complexity Results about Reasoning over ( m )CP-nets
inferred← citeshttps://doi.org/10.65109/waau9087openalex-snapshot
Committee Selection using Attribute Approvals
inferred← citeshttps://doi.org/10.65109/xlxr4218openalex-snapshot
On the Distance Between CP-nets
inferred← citeshttps://doi.org/10.70675/da1170ebzcd3fz4a26z8fd2z86744b0d6154openalex-snapshot
Influence in combinatorial and collective decision-making : by the example of UN security council voting
Editorial review for independent work. ICSAC — the Institute for Complexity Science and Advanced Computing — runs a structured editorial panel for researchers publishing outside journals, and publishes on CiteStamp rails. Submission is free and goes through ORCID: icsacinstitute.org/submit.