Elicitation for Preferences Single Peaked on Trees

Authors: Palash Dey, Neeldhara Misra

IJCAI 2016 | Conference PDF | Archive PDF | Plain Text | LLM Run Details

Reproducibility Variable Result LLM Response
Research Type Theoretical We study the query complexity for preference elicitation when the preference profile is single peaked on a tree. We provide tight connections between various parameters of the underlying tree and the query complexity for preference elicitation.
Researcher Affiliation Academia Palash Dey Indian Institute of Science, Bangalore palash@csa.iisc.ernet.in Neeldhara Misra Indian Institute of Technology, Gandhinagar mail@neeldhara.com
Pseudocode No The paper describes algorithmic strategies and proofs in prose (e.g., 'The idea is to partition the tree into k disjoint paths, use the algorithm from Theorem 1...'), but it does not include formal pseudocode blocks or algorithm listings.
Open Source Code No The paper does not provide any links to source code repositories or explicitly state that the code for their described methodology is being released.
Open Datasets No The paper is theoretical and does not use or reference any datasets for training or evaluation. Therefore, no information on public dataset access is relevant or provided.
Dataset Splits No The paper is theoretical and does not involve experimental data or dataset splits for training, validation, or testing.
Hardware Specification No The paper is theoretical and does not describe any experimental setup that would require hardware specifications.
Software Dependencies No The paper is theoretical and does not describe any computational experiments that would require specific software dependencies with version numbers.
Experiment Setup No The paper is theoretical and focuses on mathematical proofs and algorithmic analysis rather than empirical experiments, hence no experimental setup details like hyperparameters or training configurations are provided.