Operation Frames and Clubs in Kidney Exchange
Authors: Gabriele Farina, John P. Dickerson, Tuomas Sandholm
IJCAI 2017 | Conference PDF | Archive PDF | Plain Text | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Experimental | Experiments show that in the single-donation setting, operation frames improve planning by 34% 51%. |
| Researcher Affiliation | Academia | Gabriele Farina Computer Science Department Carnegie Mellon University gfarina@cs.cmu.edu John P. Dickerson Computer Science Department University of Maryland john@cs.umd.edu Tuomas Sandholm Computer Science Department Carnegie Mellon University sandholm@cs.cmu.edu |
| Pseudocode | No | The paper presents mathematical formulations, such as "Formulation 1: MIP formulation for the capped problem", but it does not include any explicitly labeled pseudocode or algorithm blocks. |
| Open Source Code | No | The paper does not provide a link to open-source code for the described methodology, nor does it state that the code is released or available in supplementary materials. |
| Open Datasets | No | The experiments are conducted using the real data from the UNOS kidney exchange that started in 2010. ... In each experiment, we subsample vertices from this master graph (and keep the edges between the selected vertices) to generate multiple problem instances, i.e., input graphs. |
| Dataset Splits | No | The paper describes how problem instances were generated by subsampling from a master graph and details experimental parameters, but it does not specify explicit training, validation, and test dataset splits with percentages or sample counts for model training. |
| Hardware Specification | No | The paper does not provide any specific details about the hardware (e.g., CPU, GPU models, memory) used to run the experiments. |
| Software Dependencies | No | The paper mentions that the problem can be formulated as an integer program and references "the state of the art formulation is called PICEF", but it does not list specific software dependencies with version numbers (e.g., names of solvers like CPLEX or Gurobi with their versions). |
| Experiment Setup | Yes | The operation frames DAG was chosen to be a total order. The first experiment compares the standard model (Section 3.1) to our capped operation-frame-based model. In both cases, at most one donor from each pair is used. In both cases, the cap is four... In both cases, we sample around 5% of the vertices to be altruists from the master graph... The second experiment is exactly like the first, except that in the capped operation-frame-based model, up to two of the donors from each vertex can be used (i.e., αc = 2 for clubs c that have more than one donor). ... In the third experiment we sample more multi-donor pairs roughly 10% of the entire pool. |