atlas

Research map / Learning theory and algorithms / Submodular and game algorithms

Restricted Domains of Dichotomous Preferences with Possibly Incomplete Information

AAAI 2021 · Learning theory and algorithms › Submodular and game algorithms · approach: Committee voting rules · 10 citations (OpenAlex)

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.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use forbidden-pattern filling followed by a voter-order graph for SVEIIncomplete dichotomous profiles · SVEI possible completionruntime: O(m3n3)Helped
Use coarsening and SVEI-INCOMPLETE to construct a VEI completionIncomplete dichotomous profiles · VEI possible completionruntime: O(m4n2)Helped
Check forbidden configurations for SVEI in an incomplete profileIncomplete dichotomous profiles · SVEI necessary completionruntime: polynomial timeHelped
Check forbidden configurations for VEI in an incomplete profileIncomplete dichotomous profiles · VEI necessary completionruntime: polynomial timeHelped
Complete the profile while requiring VIIncomplete dichotomous profiles · VI possible completioncomputational complexity: NP-completeHurt

Closest papers by meaning

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.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy