On the public citation graph

Uniform Random Generation and Dominance Testing for CP-Nets

0 signed · 87 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/978-0-230-37405-8_1openalex-snapshot
Introduction to algorithms
inferredcites →https://doi.org/10.1007/978-0-387-85820-3openalex-snapshot
Recommender Systems Handbook
inferredcites →https://doi.org/10.1007/978-3-031-01573-1_7openalex-snapshot
CRISNER: A Practically Efficient Reasoner for Qualitative Preferences
inferredcites →https://doi.org/10.1007/978-3-319-03680-9_32openalex-snapshot
Updates and Uncertainty in CP-Nets
inferredcites →https://doi.org/10.1007/978-3-319-10428-7_28openalex-snapshot
Aggregating CP-nets with Unfeasible Outcomes
inferredcites →https://doi.org/10.1007/978-3-319-23114-3_1openalex-snapshot
Beyond Theory and Data in Preference Modeling: Bringing Humans into the Loop
inferredcites →https://doi.org/10.1007/978-3-319-23114-3_33openalex-snapshot
CP-nets: From Theory to Practice
inferredcites →https://doi.org/10.1007/978-3-319-45856-4_7openalex-snapshot
Graphical Models for Preference Representation: An Overview
inferredcites →https://doi.org/10.1007/978-3-540-73086-6_12openalex-snapshot
The On-Line Encyclopedia of Integer Sequences
inferredcites →https://doi.org/10.1007/978-3-642-11266-9_29openalex-snapshot
Learning User Preferences for 2CP-Regression for a Recommender System
inferredcites →https://doi.org/10.1007/978-3-642-14125-6_1openalex-snapshot
Preference Learning: An Introduction
inferredcites →https://doi.org/10.1007/978-3-642-14125-6_12openalex-snapshot
Learning Lexicographic Preference Models
inferredcites →https://doi.org/10.1007/978-3-642-17572-5_33openalex-snapshot
Strategy-Proof Voting Rules over Multi-issue Domains with Restricted Preferences
inferredcites →https://doi.org/10.1007/978-3-642-20441-8_9openalex-snapshot
Modeling the Outcomes of Vote-Casting in Actual Elections
inferredcites →https://doi.org/10.1007/978-3-642-24873-3_13openalex-snapshot
Empirical Evaluation of Voting Rules with Strictly Ordered Preference Data
inferredcites →https://doi.org/10.1007/978-3-642-30737-9_7openalex-snapshot
Heuristic-Based Approaches for CP-Nets in Negotiation
inferredcites →https://doi.org/10.1007/978-3-642-31594-7_12openalex-snapshot
Efficient Sampling Methods for Discrete Distributions
inferredcites →https://doi.org/10.1007/978-3-642-33558-7_69openalex-snapshot
Aggregating Conditionally Lexicographic Preferences on Multi-issue Domains
inferredcites →https://doi.org/10.1007/978-3-642-41575-3_16openalex-snapshot
Learning CP-net Preferences Online from User Queries
inferredcites →https://doi.org/10.1007/978-3-642-41575-3_19openalex-snapshot
Aggregating Conditionally Lexicographic Preferences Using Answer Set Programming Solvers
inferredcites →https://doi.org/10.1007/978-3-662-48995-6_23openalex-snapshot
Often Harder than in the Constructive Case: Destructive Bribery in CP-nets
inferredcites →https://doi.org/10.1007/bf00127533openalex-snapshot
Paradox of voting under an urn model: The effect of homogeneity
inferredcites →https://doi.org/10.1007/s00355-003-0269-zopenalex-snapshot
The impartial culture maximizes the probability of majority cycles
inferredcites →https://doi.org/10.1007/s00500-002-0223-5openalex-snapshot
Efficient coding of labeled directed acyclic graphs
inferredcites →https://doi.org/10.1007/s10472-012-9326-6openalex-snapshot
A behavioral perspective on social choice
inferredcites →https://doi.org/10.1007/s10472-013-9330-5openalex-snapshot
Bribery in voting with CP-nets
inferredcites →https://doi.org/10.1007/s10732-014-9276-8openalex-snapshot
Aggregating multi-valued CP-nets: a CSP-based approach
inferredcites →https://doi.org/10.1016/0166-218x(95)00117-aopenalex-snapshot
Nondegenerate functions and permutations
inferredcites →https://doi.org/10.1016/0196-6774(90)90002-vopenalex-snapshot
Generating random combinatorial objects
inferredcites →https://doi.org/10.1016/j.artint.2011.03.004openalex-snapshot
Preferences in AI: An overview
inferredcites →https://doi.org/10.1016/j.knosys.2012.11.006openalex-snapshot
Learning conditional preference network from noisy samples using hypothesis testing
inferredcites →https://doi.org/10.1016/j.mathsocsci.2008.12.010openalex-snapshot
Sequential composition of voting rules in multi-issue domains
inferredcites →https://doi.org/10.1016/s0304-3975(98)00277-1openalex-snapshot
Preference structures and their numerical representations
inferredcites →https://doi.org/10.1016/s0898-1221(96)90087-5openalex-snapshot
Empirical methods for artificial intelligence
inferredcites →https://doi.org/10.1017/cbo9781107446984openalex-snapshot
Handbook of Computational Social Choice
inferredcites →https://doi.org/10.1023/a:1015551010381openalex-snapshot
Condorcet's paradox and the likelihood of its occurrence: different perspectives on balanced preferences*
inferredcites →https://doi.org/10.1080/00018730601170527openalex-snapshot
Characterization of complex networks: A survey of measurements
inferredcites →https://doi.org/10.1090/psapm/010/0113289openalex-snapshot
Teaching combinatorial tricks to a computer
inferredcites →https://doi.org/10.1093/comjnl/12.3.220openalex-snapshot
Mathematical Theory of Switching Circuits and Automata
inferredcites →https://doi.org/10.1109/tkde.2012.231openalex-snapshot
Learning Conditional Preference Networks from Inconsistent Examples
inferredcites →https://doi.org/10.1145/1244002.1244073openalex-snapshot
Using CP-nets as a guide for countermeasure selection
inferredcites →https://doi.org/10.1145/1993574.1993602openalex-snapshot
Strategic sequential voting in multi-issue domains and multiple-election paradoxes
inferredcites →https://doi.org/10.1145/321105.321107openalex-snapshot
A Theorem on Boolean Matrices
inferredcites →https://doi.org/10.1145/367766.368168openalex-snapshot
Algorithm 97: Shortest path
inferredcites →https://doi.org/10.1525/9780520310896openalex-snapshot
Mathematical Theory of Switching Circuits and Automata
inferredcites →https://doi.org/10.1609/aaai.v24i1.7599openalex-snapshot
Dominance Testing via Model Checking
inferredcites →https://doi.org/10.1609/aaai.v28i1.8859openalex-snapshot
A Parameterized Complexity Analysis of Generalized CP-Nets
inferredcites →https://doi.org/10.1609/aaai.v30i1.10115openalex-snapshot
Generating CP-Nets Uniformly at Random
inferredcites →https://doi.org/10.1609/aimag.v29i4.2180openalex-snapshot
Preference Handling for Artificial Intelligence
inferredcites →https://doi.org/10.1609/aimag.v29i4.2201openalex-snapshot
Preference Handling in Combinatorial Domains: From AI to Social Choice
inferredcites →https://doi.org/10.1613/jair.2490openalex-snapshot
SATzilla: Portfolio-based Algorithm Selection for SAT
inferredcites →https://doi.org/10.1613/jair.2627openalex-snapshot
The Computational Complexity of Dominance and Consistency in CP-Nets
inferredcites →https://doi.org/10.1613/jair.2861openalex-snapshot
ParamILS: An Automatic Algorithm Configuration Framework
inferredcites →https://doi.org/10.1613/jair.3223openalex-snapshot
Where are the hard manipulation problems
inferredcites →https://doi.org/10.2200/s00372ed1v01y201107aim014openalex-snapshot
A Short Introduction to Preferences: Between Artificial Intelligence and Social Choice
inferredcites →https://doi.org/10.2307/2317055openalex-snapshot
The Art of Computer Programming. Volume 2: Seminumerical Algorithms.
inferredcites →https://doi.org/10.3233/978-1-60750-606-5-257openalex-snapshot
An Empirical Study of the Manipulability of Single Transferable Voting
inferredcites →https://doi.org/10.3233/978-1-60750-606-5-269openalex-snapshot
Learning conditionally lexicographic preference relations
inferredcites →https://doi.org/10.3233/978-1-61499-421-3-81openalex-snapshot
Learning Probabilistic CP-nets from Observations of Optimal Items
inferredcites →https://doi.org/10.48550/arxiv.1005.5268openalex-snapshot
An Empirical Study of the Manipulability of Single Transferable Voting
inferredcites →https://doi.org/10.48550/arxiv.1007.5114openalex-snapshot
Where are the hard manipulation problems?
inferredcites →https://doi.org/10.48550/arxiv.1101.2549openalex-snapshot
An Estimation of the Shortest and Largest Average Path Length in Graphs of Given Density
inferredcites →https://doi.org/10.48550/arxiv.1301.2259openalex-snapshot
UCP-Networks: A Directed Graphical Representation of Conditional Utilities
inferredcites →https://doi.org/10.48550/arxiv.1302.4928openalex-snapshot
Graphical Models for Preference and Utility
inferredcites →https://doi.org/10.48550/arxiv.1309.6817openalex-snapshot
Probabilistic Conditional Preference Networks
inferredcites →https://doi.org/10.5555/2030470.2030522openalex-snapshot
Efficient heuristic approach to dominance testing in CP-nets
inferredcites →https://doi.org/10.5555/2772879.2773276openalex-snapshot
Reasoning with PCP-nets in a Multi-Agent Context
inferredcites →https://doi.org/10.5860/choice.37-5717openalex-snapshot
Combinatorial algorithms: generation, enumeration, and search
inferredcites →https://doi.org/10.5860/choice.44-3496openalex-snapshot
Behavioral social choice: probabilistic models, statistical inference, and applications

What points at this work

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

inferred← citeshttps://doi.org/10.1007/978-3-030-56150-5_11openalex-snapshot
CPMetric: Deep Siamese Networks for Metric Learning on Structured Preferences
inferred← citeshttps://doi.org/10.1007/978-3-031-73903-3_15openalex-snapshot
Independent Relaxed Subproblems for Dominance Testing in CP-Nets
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.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.artint.2022.103772openalex-snapshot
Preference-based inconsistency-tolerant query answering under existential rules
inferred← citeshttps://doi.org/10.1016/j.artint.2025.104437openalex-snapshot
Constraints and lifting-based (conditional) preferences in abstract argumentation
inferred← citeshttps://doi.org/10.1093/oso/9780190905033.003.0005openalex-snapshot
Modeling and Reasoning with Preferences and Ethical Priorities in AI Systems
inferred← citeshttps://doi.org/10.1145/3278721.3278723openalex-snapshot
Preferences and Ethical Principles in Decision Making
inferred← citeshttps://doi.org/10.1201/9781351251389-18openalex-snapshot
Value Alignment via Tractable Preference Distance
inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25684openalex-snapshot
Properties of Position Matrices and Their Elections
inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25766openalex-snapshot
Abstract Argumentation Framework with Conditional Preferences
inferred← citeshttps://doi.org/10.1613/jair.1.11323openalex-snapshot
Rank Pruning for Dominance Queries in CP-Nets
inferred← citeshttps://doi.org/10.1613/jair.1.13009openalex-snapshot
Reasoning with PCP-Nets
inferred← citeshttps://doi.org/10.22266/ijies2024.0630.22openalex-snapshot
Conditional Preference Networks in Multiobjective Evolutionary Algorithms
inferred← citeshttps://doi.org/10.24963/ijcai.2019/207openalex-snapshot
On the Integration of CP-nets in ASPRIN
inferred← citeshttps://doi.org/10.48550/arxiv.2208.12747openalex-snapshot
Automatic Synthesis of Random Generators for Numerically Constrained Algebraic Recursive Types
inferred← citeshttps://doi.org/10.65109/xlxr4218openalex-snapshot
On the Distance Between CP-nets
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.