Research map / Graph learning / Graph algorithms and clustering
Generating CP-Nets Uniformly at Random
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Approximation Algorithms for Preference Aggregation Using CP-Nets (AAAI 2024 · similarity 0.89)
- Checking Consistency of CP-Theory Preferences in Polynomial Time (AAAI 2025 · similarity 0.83)
- Can a Few Decide for Many? The Metric Distortion of Sortition (ICML 2024 · similarity 0.82)
- Weak Strategyproofness in Randomized Social Choice (AAAI 2025 · similarity 0.81)
- Bandits with Preference Feedback: A Stackelberg Game Perspective (NeurIPS 2024 · similarity 0.81)
- Generalizing while preserving monotonicity in comparison-based preference learning models (NeurIPS 2025 · similarity 0.81)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.