{"id":"W2032636061","doi":"10.1007/s10458-011-9172-7","title":"A negotiation framework for linked combinatorial optimization problems","year":2011,"lang":"en","type":"article","venue":"Autonomous Agents and Multi-Agent Systems","topic":"Constraint Satisfaction and Optimization","field":"Computer Science","cited_by":24,"is_retracted":false,"has_abstract":false,"ca_institutions":"University of Toronto","funders":"","keywords":"Negotiation; Pareto principle; Computer science; Mathematical optimization; Space (punctuation); Scheduling (production processes); Multi-objective optimization; Combinatorial optimization; Pareto optimal; Operations research; Mathematics; Algorithm; Machine learning; Law","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.00434424,0.001230997,0.001823151,0.001633546,0.001994392,0.004115613,0.005088882,0.0023197,0.01011666],"category_scores_gemma":[0.008312771,0.001105132,0.002298726,0.003037756,0.002070205,0.005023682,0.004382339,0.004340453,0.001286477],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001877165,"about_ca_system_score_gemma":0.002247419,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.004888337,"about_ca_topic_score_gemma":0.00479937,"domain_scores_codex":[0.9972041,0.001413008,0.0001528288,0.0002901654,0.0006964159,0.0002435732],"domain_scores_gemma":[0.9978574,0.001382605,0.0001084141,0.0002164877,0.0002233908,0.0002116951],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.00004875677,0.00008874869,0.0001022335,0.0001068519,0.00005406129,0.0001228076,0.0001648274,0.1430359,0.000490286,0.8247917,0.003498417,0.02749545],"study_design_scores_gemma":[0.00004946247,0.00002461055,0.0000371334,0.00003238159,0.00002309206,0.00004977379,0.00005112679,0.6209632,0.0001778963,0.369998,0.008573902,0.00001929294],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.002067583,0.0003460554,0.9897934,0.000345183,0.00006538622,0.00009494206,0.00005816386,0.000128727,0.007100529],"genre_scores_gemma":[0.1625761,0.001015705,0.8242351,0.000239734,0.0002239947,0.0007570613,0.0003056811,0.0002184013,0.01042808],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.01011666,"threshold_uncertainty_score":0.03384364,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.06030290389340378,"score_gpt":0.266328702437593,"score_spread":0.2060257985441893,"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."}}