{"id":"W2136577698","doi":"10.2139/ssrn.2290795","title":"Two-Sided Matchings: An Algorithm for Ensuring They are Minimax and Pareto-Optimal","year":2013,"lang":"en","type":"article","venue":"SSRN Electronic Journal","topic":"Game Theory and Voting Systems","field":"Economics, Econometrics and Finance","cited_by":0,"is_retracted":false,"has_abstract":false,"ca_institutions":"Wilfrid Laurier University","funders":"","keywords":"Minimax; Pareto principle; Pareto optimal; Mathematical optimization; Algorithm; Computer science; Mathematics; Multi-objective optimization","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.01434066,0.001812659,0.003120943,0.003107933,0.002424757,0.003071212,0.005493809,0.00622991,0.009727171],"category_scores_gemma":[0.05433759,0.001909449,0.002050817,0.002883859,0.003117858,0.006707722,0.006397022,0.004924575,0.002672866],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002244089,"about_ca_system_score_gemma":0.005023654,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001498937,"about_ca_topic_score_gemma":0.001837058,"domain_scores_codex":[0.9935364,0.002844304,0.0004756986,0.001259672,0.001257212,0.0006267508],"domain_scores_gemma":[0.974859,0.01686536,0.001445491,0.003618479,0.002399565,0.0008121918],"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.00138907,0.0004944722,0.0023028,0.0004309323,0.0002494991,0.0001336808,0.0008632413,0.4385712,0.005045582,0.1980228,0.01541958,0.3370771],"study_design_scores_gemma":[0.000316785,0.0001375177,0.0001712331,0.0000786886,0.00004239316,0.00005899105,0.00007911616,0.8451562,0.00215389,0.1493108,0.002463168,0.00003124463],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01201086,0.00008300952,0.9830796,0.0003661124,0.00005563511,0.000351248,0.0001339411,0.000767549,0.003152045],"genre_scores_gemma":[0.1331491,0.00007012035,0.8617339,0.000302912,0.00004807013,0.0007061345,0.0003364477,0.0003713111,0.003282055],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01434066,"threshold_uncertainty_score":0.07584155,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.01606357443084286,"score_gpt":0.2215618999408164,"score_spread":0.2054983255099736,"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."}}