Possible and Necessary Allocations via Sequential Mechanisms
Authors: Haris Aziz, Toby Walsh, Lirong Xia
IJCAI 2015 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | We present characterizations of the allocations that result respectively from the classes, which extend the well-known characterization by Brams and King [2005] for policies without restrictions. In addition, we examine the computational complexity of possible and necessary allocation problems for these classes. |
| Researcher Affiliation | Academia | Haris Aziz NICTA and UNSW, Sydney 2033, Australia Haris.Aziz@nicta.com.au Toby Walsh NICTA and UNSW, Sydney 2033, Australia toby.walsh@nicta.com.au Lirong Xia RPI NY 12180, USA xial@cs.rpi.edu |
| Pseudocode | No | The paper describes algorithms in prose (e.g., mentioning 'Algorithm 1') but does not provide structured pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide any concrete access to source code for the described methodology. |
| Open Datasets | No | The paper is theoretical and does not involve training models on datasets; therefore, it does not provide information about publicly available or open datasets. |
| Dataset Splits | No | The paper is theoretical and does not involve empirical experiments requiring dataset splits. |
| Hardware Specification | No | The paper is theoretical and focuses on computational complexity analysis, not empirical experiments that would require hardware specifications. |
| Software Dependencies | No | The paper is theoretical and does not involve empirical experiments requiring software dependencies with specific version numbers. |
| Experiment Setup | No | The paper is theoretical and does not involve empirical experiments requiring details about the experimental setup such as hyperparameters or training settings. |