{"id":"W2951447937","doi":"10.48550/arxiv.1109.6182","title":"Bilinear Games: Polynomial Time Algorithms for Rank Based Subclasses","year":2011,"lang":"en","type":"preprint","venue":"arXiv (Cornell University)","topic":"Game Theory and Applications","field":"Decision Sciences","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of British Columbia","funders":"","keywords":"Rank (graph theory); Mathematics; Bilinear interpolation; Nash equilibrium; Combinatorics; Time complexity; Bayesian game; Constant (computer programming); Game theory; Mathematical economics; Sequential game; Computer science; Statistics","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.002337147,0.002680033,0.002701975,0.001599726,0.001366877,0.003449022,0.003926664,0.002166768,0.01123399],"category_scores_gemma":[0.009207538,0.001222703,0.002368715,0.001918829,0.001357957,0.007767902,0.004775438,0.005182352,0.002203748],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.003364369,"about_ca_system_score_gemma":0.002989338,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.005680302,"about_ca_topic_score_gemma":0.007351437,"domain_scores_codex":[0.9975033,0.0005498892,0.0001329704,0.0006593851,0.0005280084,0.0006265418],"domain_scores_gemma":[0.9961414,0.002427411,0.0002765916,0.0005888912,0.0002970867,0.0002686516],"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.0008142274,0.0010709,0.001760558,0.0007226748,0.0001568171,0.0002446023,0.0007523603,0.3765604,0.003518568,0.3242331,0.02697633,0.2631896],"study_design_scores_gemma":[0.0001381656,0.00006407209,0.000108864,0.00004215219,0.00002182148,0.00008821068,0.0001319753,0.6787244,0.001011663,0.3164286,0.003217795,0.00002232147],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.03688419,0.000659555,0.942237,0.001208491,0.00009372834,0.000766187,0.001067502,0.002913513,0.01416977],"genre_scores_gemma":[0.3614958,0.0006545686,0.620368,0.000865766,0.0001870583,0.001111157,0.00312537,0.0009156817,0.01127665],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01123399,"threshold_uncertainty_score":0.03758144,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2840526527271816,"score_gpt":0.2844795706364271,"score_spread":0.0004269179092455944,"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."}}