Notice: The reproducibility variables underlying each score are classified using an automated LLM-based pipeline, validated against a manually labeled dataset. LLM-based classification introduces uncertainty and potential bias; scores should be interpreted as estimates. Full accuracy metrics and methodology are described in [1].
Efficient Mechanism Design for Online Scheduling
Authors: Xujin Chen, Xiaodong Hu, Tie-Yan Liu, Weidong Ma, Tao Qin, Pingzhong Tang, Changjun Wang, Bo Zheng
JAIR 2016 | Venue PDF | LLM Run Details
| Reproducibility Variable | Result | LLM Response |
|---|---|---|
| Research Type | Theoretical | This paper concerns the mechanism design for online scheduling in a strategic setting. ... We first derive two lower bounds on the competitive ratio of any deterministic IC mechanism to characterize the landscape of our research: one bound is 5, which holds for equal-length jobs; the other bound is Îș ln Îș +1 o(1), which holds for unequal-length jobs... We then propose a deterministic IC mechanism and show that such a simple mechanism works very well for two models... |
| Researcher Affiliation | Collaboration | Authors are affiliated with "AMSS, Chinese Academy of Science" (academic/public research), "Microsoft Research" (industry), "Tsinghua University" (academic), and "Beijing University of Technology" (academic). This mix of academic and industry affiliations indicates a collaboration. |
| Pseudocode | Yes | The paper includes clearly labeled algorithm blocks such as "Algorithm 2: Allocation Rule" and "Payment Rule" in Section 3.1, and "Algorithm 3: Compute the critical-value payment in the restart model", "Algorithm 4: Compute the critical-value payment in the resume model", "Algorithm 5: The allocation rule of Mechanism Î2", and "Algorithm 6: The allocation rule of Mechanism Î3" in Appendix A and E. |
| Open Source Code | No | The paper does not provide any concrete statement or link regarding the availability of its source code. It mentions a "working paper (Ma, Zheng, Qin, Tang, & Liu, 2014)" for more details on an extension but this is not a code release. |
| Open Datasets | No | The paper describes theoretical models and mechanisms for online scheduling. It does not perform or present experimental evaluations using specific datasets, therefore, it does not provide access information for any datasets. |
| Dataset Splits | No | The paper is theoretical and does not involve experimental evaluation with datasets. Consequently, there are no mentions or descriptions of dataset splits. |
| Hardware Specification | No | The paper is theoretical and focuses on mechanism design and competitive analysis. It does not describe any experimental setup or mention specific hardware used for running experiments. |
| Software Dependencies | No | The paper is theoretical, presenting algorithms and their competitive analysis. It does not mention any specific software dependencies or their version numbers. |
| Experiment Setup | No | The paper focuses on theoretical mechanism design and competitive analysis, providing proofs and algorithm descriptions. It does not include an experimental section or describe any specific experimental setup details such as hyperparameters or training configurations. |