{"id":"W2521963297","doi":"","title":"Tight bounds on the competitive ratio on accomodating sequences for the seat reservation problem","year":2000,"lang":"en","type":"article","venue":"Centrum Wiskunde & Informatica (CWI), the national research institute for mathematics and computer science in the Netherlands","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"Natural Sciences and Engineering Research Council of Canada; National Science Foundation; Centrum Wiskunde and Informatica; Nederlandse Organisatie voor Wetenschappelijk Onderzoek; European Research Consortium for Informatics and Mathematics; Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Reservation; Competitive analysis; Upper and lower bounds; Matching (statistics); Combinatorics; Line (geometry); Asymptotically optimal algorithm; Computer science; Mathematics; Discrete mathematics; Mathematical optimization; Computer network; Statistics","routes":{"ca_aff":false,"ca_fund":true,"ca_venue":false,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["sts","scholarly_communication"],"consensus_categories":[],"category_scores_codex":[0.01765021,0.000228456,0.0001938479,0.000258398,0.003878193,0.002852381,0.003713784,0.00006785092,0.00002222213],"category_scores_gemma":[0.001049283,0.00009940792,0.00008705799,0.001581138,0.001432925,0.001484227,0.0003385454,0.0005720404,0.00002218692],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002243626,"about_ca_system_score_gemma":0.0006835102,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001669343,"about_ca_topic_score_gemma":0.00004211827,"domain_scores_codex":[0.9951217,0.0002346627,0.000611749,0.0003660854,0.002911616,0.0007541554],"domain_scores_gemma":[0.9912304,0.006822104,0.0001919047,0.0005931981,0.001063972,0.00009842455],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003248296,0.0001047049,0.000009735351,0.00005079814,0.00001762028,3.214684e-7,0.008604621,0.03061569,0.000007189702,0.9398636,0.002818693,0.0178746],"study_design_scores_gemma":[0.0004335881,0.0003069983,0.000119538,0.0001458859,0.000003444932,0.00001187729,0.0005978837,0.8554915,0.00005001452,0.1225271,0.02018717,0.000125001],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01523596,0.000049679,0.8249509,0.1250412,0.0004591638,0.00740223,0.00006854474,0.00009275318,0.02669958],"genre_scores_gemma":[0.9128267,0.0003298373,0.0743918,0.009309046,0.000546256,0.001885935,0.00004644488,0.00002884057,0.0006351962],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8975907,"threshold_uncertainty_score":0.9981828,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1140742094178715,"score_gpt":0.3627707798904767,"score_spread":0.2486965704726053,"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."}}