{"id":"W4401879294","doi":"10.1109/tnet.2024.3444593","title":"Game-Theoretic Bandits for Network Optimization With High-Probability Swap-Regret Upper Bounds","year":2024,"lang":"en","type":"article","venue":"IEEE/ACM Transactions on Networking","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Victoria","funders":"British Columbia Knowledge Development Fund; Natural Sciences and Engineering Research Council of Canada; Canada Foundation for Innovation","keywords":"Regret; Swap (finance); Computer science; Mathematical optimization; Mathematical economics; Upper and lower bounds; Mathematics; Economics; Machine learning","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.005372081,0.003008178,0.00318886,0.001125959,0.001188263,0.002939799,0.002415741,0.002635127,0.004967927],"category_scores_gemma":[0.01798383,0.0009964363,0.001229519,0.001518604,0.002829695,0.004316083,0.002641085,0.004794195,0.0009358606],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002823386,"about_ca_system_score_gemma":0.001980738,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003928512,"about_ca_topic_score_gemma":0.003175127,"domain_scores_codex":[0.997173,0.001467343,0.0001024591,0.0003549978,0.0004923221,0.0004098963],"domain_scores_gemma":[0.9877907,0.009800115,0.0008442584,0.0005071794,0.0006557098,0.0004020149],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0001401718,0.0001023233,0.0004712358,0.0001711599,0.00007003073,0.00008311644,0.00007530653,0.866354,0.0004665815,0.1184717,0.002465772,0.01112848],"study_design_scores_gemma":[0.00001440262,0.00002994339,0.00005663532,0.00001800709,0.00001252924,0.00001098475,0.00001116081,0.956921,0.0001247136,0.0422826,0.0005109295,0.000006935681],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01673554,0.002142286,0.9691703,0.001007102,0.0001693821,0.000089332,0.0001391299,0.0003561595,0.01019084],"genre_scores_gemma":[0.840534,0.00321769,0.1405006,0.000931666,0.0004970797,0.0006105777,0.0003576026,0.0003369714,0.01301378],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.005372081,"threshold_uncertainty_score":0.02841061,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.0798903136994101,"score_gpt":0.3709269861772752,"score_spread":0.291036672477865,"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."}}