{"id":"W4293029109","doi":"10.1609/aaai.v30i1.10077","title":"Solving the Station Repacking Problem","year":2016,"lang":"en","type":"article","venue":"Proceedings of the AAAI Conference on Artificial Intelligence","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Solver; Computer science; Mathematical optimization; Reuse; Set (abstract data type); Auction algorithm; Graph; Integer programming; Incentive compatibility; Incentive; Theoretical computer science; Algorithm; Common value auction; Mathematics; Economics; Auction theory; Engineering; Programming language","routes":{"ca_aff":true,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":false},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002878303,0.0008802523,0.001034475,0.0006592391,0.001300867,0.001707622,0.002224365,0.00262662,0.01187742],"category_scores_gemma":[0.0113017,0.0006002625,0.001126953,0.00116662,0.001250396,0.002937367,0.001579575,0.002459161,0.0009861506],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001056118,"about_ca_system_score_gemma":0.002270425,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.007964455,"about_ca_topic_score_gemma":0.007240574,"domain_scores_codex":[0.9982294,0.0008816978,0.0000693429,0.0003030781,0.0002728358,0.0002435954],"domain_scores_gemma":[0.9940322,0.004601566,0.0003925973,0.0004176387,0.0003502051,0.0002057909],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000261066,0.0003046329,0.002068127,0.0002883725,0.0001276176,0.0003840968,0.0002605628,0.8456013,0.001234777,0.08466376,0.008942369,0.05586346],"study_design_scores_gemma":[0.0001215794,0.000226693,0.0004579971,0.00005072948,0.00005304533,0.0002043332,0.0003947425,0.9270729,0.001942929,0.06052807,0.008921403,0.00002556867],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.195602,0.0009647349,0.7481506,0.003760372,0.0003325208,0.0005163654,0.0008872653,0.0008979,0.04888821],"genre_scores_gemma":[0.6625237,0.0007877208,0.3193238,0.0005947566,0.0001311411,0.0003594438,0.001228531,0.0002544085,0.01479646],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01187742,"threshold_uncertainty_score":0.03973395,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2165750431172893,"score_gpt":0.3919628146510241,"score_spread":0.1753877715337349,"validation_status":"score_only:v0-immature-baseline","note":"Baseline scores from an immature model (maturity gate not passed). Scores rank; they never assert a category."}}