{"id":"W2027154380","doi":"10.1016/j.tcs.2014.10.037","title":"Improving the <mml:math xmlns:mml=\"http://www.w3.org/1998/Math/MathML\" altimg=\"si1.gif\" overflow=\"scroll\"><mml:msub><mml:mrow><mml:mi>H</mml:mi></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msub></mml:math>-bound on the price of stability in undirected Shapley network design games","year":2014,"lang":"lv","type":"article","venue":"Theoretical Computer Science","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":14,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Waterloo","funders":"Schweizerischer Nationalfonds zur Förderung der Wissenschaftlichen Forschung","keywords":"Upper and lower bounds; Stability (learning theory); Function (biology); Combinatorics; Mathematics; Algorithm; Computer science; Discrete mathematics; Mathematical economics; Machine learning; Mathematical analysis","routes":{"ca_aff":true,"ca_fund":false,"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.006463315,0.002637809,0.001667666,0.002326855,0.00164045,0.005074646,0.004451164,0.002990646,0.04831902],"category_scores_gemma":[0.04237176,0.0008898671,0.002460845,0.002582085,0.002187242,0.01364818,0.005450965,0.007180688,0.008684927],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003718665,"about_ca_system_score_gemma":0.00363431,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003636638,"about_ca_topic_score_gemma":0.005317234,"domain_scores_codex":[0.9962746,0.001510894,0.0001382744,0.0007089328,0.000965294,0.0004020062],"domain_scores_gemma":[0.9776659,0.01614971,0.0005992047,0.002869848,0.001877952,0.000837496],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002830681,0.0005707989,0.001514934,0.0005983564,0.0001432172,0.0001647774,0.0004003578,0.07268656,0.002934491,0.7902913,0.04859769,0.08181439],"study_design_scores_gemma":[0.00007432532,0.0001196819,0.0004614651,0.0001503288,0.00006934815,0.0001192033,0.00009373414,0.2564526,0.001776227,0.7276197,0.01302074,0.0000426884],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.03455656,0.001723215,0.7857308,0.009154661,0.0009347424,0.0002988398,0.001096415,0.001024539,0.1654802],"genre_scores_gemma":[0.5831511,0.002971207,0.3567744,0.00301795,0.001079518,0.0005699464,0.001821694,0.001606918,0.0490072],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.04831902,"threshold_uncertainty_score":0.1616432,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.03073461169615029,"score_gpt":0.2641081378752692,"score_spread":0.2333735261791189,"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."}}