{"id":"W3124612572","doi":"","title":"Two-Sided Matchings: An Algorithm for Ensuring They Are Minimax and Pareto-Optimal","year":2013,"lang":"en","type":"article","venue":"LA Referencia (Red Federada de Repositorios Institucionales de Publicaciones Científicas)","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":true,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Minimax; Matching (statistics); Pareto principle; Pareto optimal; Rank (graph theory); Mathematical optimization; Mathematics; Simple (philosophy); Computer science; Algorithm; Combinatorics; Multi-objective optimization; 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"],"consensus_categories":[],"category_scores_codex":[0.00112975,0.0003729775,0.0006167839,0.0003274331,0.0005964393,0.0004331906,0.0004214307,0.0003012852,0.00004058863],"category_scores_gemma":[0.0004310805,0.0003962442,0.0001728745,0.0001815422,0.00002170121,0.0007701324,0.0001296709,0.0003338607,0.00004258712],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002142425,"about_ca_system_score_gemma":0.000061016,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00001435943,"about_ca_topic_score_gemma":0.00007682447,"domain_scores_codex":[0.9973958,0.0001393701,0.0008712392,0.0008125682,0.0001287247,0.0006523405],"domain_scores_gemma":[0.9979863,0.0002946198,0.0006537513,0.0004861707,0.0001916222,0.0003875796],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.00004367034,0.0002201626,0.002875599,0.00008419818,0.0001118149,0.00001493249,0.002185228,0.00007494605,0.0003733945,0.9908339,0.0001658014,0.003016309],"study_design_scores_gemma":[0.006126666,0.000452668,0.04595557,0.000505255,0.00009680617,0.001597137,0.005491761,0.04571913,0.001016564,0.06049027,0.830038,0.002510164],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9335093,0.0008693011,0.02440042,0.00478758,0.001324711,0.001439511,0.0003377844,0.0004646827,0.03286668],"genre_scores_gemma":[0.981481,0.00003335838,0.01686254,0.0001584463,0.0006228407,0.0004053952,0.0000827269,0.00006313055,0.0002905545],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.9303437,"threshold_uncertainty_score":0.999849,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02839328585553937,"score_gpt":0.2351204699205095,"score_spread":0.2067271840649701,"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."}}