On the public citation graph
The Strategy-Proofness Landscape of Merging
0 signed · 40 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-54563-8_73openalex-snapshot
Combining knowledge bases consisting of first order theories
inferredcites →https://doi.org/10.1007/978-94-009-2865-7_6openalex-snapshot
Ordinal Conditional Functions: A Dynamic Theory of Epistemic States
inferredcites →https://doi.org/10.1007/pl00007177openalex-snapshot
Strategic manipulability without resoluteness or shared beliefs: Gibbard-Satterthwaite generalized
inferredcites →https://doi.org/10.1007/s00355-008-0304-1openalex-snapshot
On strategy-proof social choice correspondences
inferredcites →https://doi.org/10.1007/s003550100134openalex-snapshot
Multi-valued strategy-proof social choice rules
inferredcites →https://doi.org/10.1016/j.inffus.2005.05.003openalex-snapshot
Social choice theory, belief merging, and strategy-proofness
inferredcites →https://doi.org/10.1016/j.tcs.2005.05.009openalex-snapshot
Non-cooperative computation: Boolean functions with correctness and exclusivity
inferredcites →https://doi.org/10.1023/a:1014446411602openalex-snapshot
Possibilistic Merging and Distance-Based Fusion of Propositional Information
inferredcites →https://doi.org/10.1093/logcom/12.5.773openalex-snapshot
Merging Information Under Constraints: A Logical Framework
inferredcites →https://doi.org/10.1145/846241.846268openalex-snapshot
How many candidates are needed to make elections hard to manipulate?
inferredcites →https://doi.org/10.1184/r1/6611567openalex-snapshot
Universal Voting Protocol Tweaks to Make Manipulation Hard
inferredcites →https://doi.org/10.48550/arxiv.cs/0205076openalex-snapshot
Complexity of Manipulating Elections with Few Candidates
inferredcites →https://doi.org/10.5555/777092.777155openalex-snapshot
Vote elicitation: complexity and strategy-proofness
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/malq.200810020openalex-snapshot
Sincere‐Strategy Preference‐Based Approval Voting Fully Resists Constructive Control and Broadly Resists Destructive Control
inferred← citeshttps://doi.org/10.1007/978-3-030-19570-0_9openalex-snapshot
Manipulating Skeptical and Credulous Consequences When Merging Beliefs
inferred← citeshttps://doi.org/10.1007/978-3-030-33792-6_23openalex-snapshot
Identifying Belief Sequences in a Network of Communicating Agents
inferred← citeshttps://doi.org/10.1007/978-3-030-86772-0_33openalex-snapshot
Merging Epistemic States and Manipulation
inferred← citeshttps://doi.org/10.1007/978-3-031-09016-5_6openalex-snapshot
Related Formalisms and Applications
inferred← citeshttps://doi.org/10.1007/978-3-031-20614-6_1openalex-snapshot
Iterative Goal-Based Approval Voting
inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_44openalex-snapshot
Measuring Dissimilarity between Judgment Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-67504-6_30openalex-snapshot
Logic-Based Merging in Fragments of Classical Logic with Inputs from Social Choice Theory
inferred← citeshttps://doi.org/10.1007/978-3-540-85238-4_25openalex-snapshot
Sincere-Strategy Preference-Based Approval Voting Broadly Resists Control
inferred← citeshttps://doi.org/10.1007/978-3-642-02839-7_10openalex-snapshot
Computational Aspects of Approval Voting
inferred← citeshttps://doi.org/10.1007/978-3-642-04428-1_1openalex-snapshot
A Complete Conclusion-Based Procedure for Judgment Aggregation
inferred← citeshttps://doi.org/10.1007/978-3-642-25324-9_4openalex-snapshot
Belief Merging Using Normal Forms
inferred← citeshttps://doi.org/10.1007/978-3-642-31485-8_5openalex-snapshot
Introduction to Judgment Aggregation
inferred← citeshttps://doi.org/10.1016/j.artint.2010.05.001openalex-snapshot
Disjunctive merging: Quota and Gmin merging operators
inferred← citeshttps://doi.org/10.1016/j.artint.2017.06.003openalex-snapshot
Impossibility in belief merging
inferred← citeshttps://doi.org/10.1016/j.engappai.2013.07.006openalex-snapshot
Tasks for agent-based negotiation teams: Analysis, review, and challenges
inferred← citeshttps://doi.org/10.1016/j.ijar.2014.04.006openalex-snapshot
Sum-based weighted belief base merging: From commensurable to incommensurable framework
inferred← citeshttps://doi.org/10.1016/j.ijar.2023.01.005openalex-snapshot
On manipulation in merging epistemic states
inferred← citeshttps://doi.org/10.1093/logcom/exs056openalex-snapshot
Ontology merging as social choice: judgment aggregation under the open world assumption
inferred← citeshttps://doi.org/10.15446/recolma.v51n2.70900openalex-snapshot
A weak version of Barberà-Kelly's Theorem
inferred← citeshttps://doi.org/10.2200/s00559ed1v01y201312aim027openalex-snapshot
Judgment Aggregation: A Primer
inferred← citeshttps://doi.org/10.24963/ijcai.2020/244openalex-snapshot
Belief Merging Operators as Maximum Likelihood Estimators
inferred← citeshttps://doi.org/10.3233/aic-220306openalex-snapshot
On the links between belief merging, the Borda voting method, and the cancellation property1
inferred← citeshttps://doi.org/10.70675/d7851eebz44fez4231z9483z6b881501cb98openalex-snapshot
Collective decision-making with goals
inferred← citeshttps://doi.org/10.70675/f8f1a121zc0d9z4f52z8475ze44f898b61a2openalex-snapshot
Sur la fusion d'ontologies à domaine ouvert
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.