{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.01580686,0.001677425,0.002524399,0.003466313,0.002431849,0.003216665,0.004379337,0.003843646,0.008923293],"category_scores_gemma":[0.04396112,0.001373519,0.001764947,0.003845076,0.003318669,0.006272384,0.004708401,0.00322827,0.002800798],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002606761,"about_ca_system_score_gemma":0.005055132,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001720935,"about_ca_topic_score_gemma":0.001814111,"domain_scores_codex":[0.9919627,0.003866003,0.0005310722,0.00123219,0.001664345,0.0007436045],"domain_scores_gemma":[0.9839062,0.009717914,0.001397294,0.002545627,0.001859227,0.0005738217],"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.000732211,0.0003705918,0.003354767,0.0004049277,0.0002319972,0.0001828993,0.0009063998,0.3660968,0.003690165,0.3422136,0.0172218,0.2645938],"study_design_scores_gemma":[0.0002896316,0.0001724256,0.0003856823,0.0001214465,0.00003820258,0.0001183073,0.0001158437,0.6672347,0.002108001,0.3217574,0.007604439,0.00005404152],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01558374,0.0001709697,0.9764302,0.0003172579,0.0000699112,0.0005186639,0.0001874067,0.0006325961,0.006089233],"genre_scores_gemma":[0.1256396,0.0001279282,0.8693017,0.000257113,0.00005950602,0.0008088186,0.0004304088,0.0003544422,0.003020487],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.01580686,"threshold_uncertainty_score":0.08359563,"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."}}