{"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":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001656208,0.0003699304,0.0005836672,0.0004788775,0.0002704249,0.0001644024,0.002311884,0.0004060586,0.001545769],"category_scores_gemma":[0.0006540671,0.0003490892,0.0005942981,0.0007387887,0.0003753507,0.0002058737,0.0006156844,0.00039611,0.001893344],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00009457662,"about_ca_system_score_gemma":0.0004346093,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00005876842,"about_ca_topic_score_gemma":0.00001805036,"domain_scores_codex":[0.9971017,0.0002871644,0.0004764792,0.001515092,0.0002113369,0.0004081779],"domain_scores_gemma":[0.9950196,0.001867216,0.0005025562,0.001851313,0.000508187,0.0002511519],"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.007096814,0.004255055,0.007970274,0.0003940379,0.001282595,0.000390772,0.002261993,0.393865,0.006094154,0.3681338,0.1764772,0.03177834],"study_design_scores_gemma":[0.002317609,0.0002043868,0.0007718048,0.00006972587,0.0003537837,0.000003312565,0.0004029399,0.4752722,0.003596468,0.4539678,0.06188209,0.00115793],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.4783985,0.00004884045,0.5068983,0.0003253946,0.0007484991,0.001506527,0.0006897023,0.0003056641,0.0110785],"genre_scores_gemma":[0.9743207,0.00001546468,0.002674384,0.000151375,0.000238464,0.00001011857,0.00007294259,0.00003445767,0.02248215],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.5042239,"threshold_uncertainty_score":0.9998961,"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."}}