{"id":"W2123976299","doi":"10.1109/focs.2009.51","title":"On Allocating Goods to Maximize Fairness","year":2009,"lang":"en","type":"article","venue":"","topic":"Optimization and Search Problems","field":"Computer Science","cited_by":122,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"","keywords":"Set (abstract data type); Logarithm; Approximation algorithm; Combinatorics; Computer science; Binary logarithm; Polynomial; Time complexity; Discrete mathematics; Mathematics; Algorithm","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":[],"consensus_categories":[],"category_scores_codex":[0.0001754425,0.00006124166,0.00006236333,0.00006845957,0.00006812274,0.0001506096,0.0004743481,0.00002061053,0.00007834838],"category_scores_gemma":[0.00004917527,0.00005020265,0.00001970403,0.0003395483,0.000004490877,0.0001738826,0.00006519855,0.00005584141,0.0002844072],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001708483,"about_ca_system_score_gemma":0.00002181413,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000006730498,"about_ca_topic_score_gemma":0.000002017106,"domain_scores_codex":[0.9992877,0.00002694291,0.0001005396,0.0002087495,0.0001906068,0.0001855023],"domain_scores_gemma":[0.9994917,0.00003593248,0.00001438503,0.0002984219,0.00004104279,0.000118515],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.000002665832,0.00005816883,0.0000102914,0.000001365957,0.000001654767,0.000002866375,0.0003804237,0.03191161,0.00023273,0.8423287,0.005067459,0.1200021],"study_design_scores_gemma":[0.0008490082,0.0009722445,0.002145443,0.00004662786,0.00000137853,0.000008033446,0.00006173433,0.9057472,0.004440978,0.07688729,0.008312789,0.0005272541],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.0004361969,0.000001981799,0.8846697,0.01042411,0.00006267878,0.0001072,8.958118e-8,0.0001960648,0.104102],"genre_scores_gemma":[0.5800691,0.000001612463,0.4028201,0.01288306,0.00001988955,0.00000564708,6.421515e-7,0.000003362398,0.004196567],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.8738356,"threshold_uncertainty_score":0.3655574,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.02045645435473559,"score_gpt":0.2815966787049548,"score_spread":0.2611402243502192,"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."}}