{"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":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.0002788849,0.0001856029,0.0002103868,0.0001211053,0.0002622811,0.0002385179,0.0002244407,0.0001648968,0.0000300152],"category_scores_gemma":[0.00005755351,0.0001788202,0.00006387105,0.0001620799,0.00002982268,0.0004617252,0.00006903648,0.0000888932,0.00001278611],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000080923,"about_ca_system_score_gemma":0.00005940396,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001372227,"about_ca_topic_score_gemma":0.000004784154,"domain_scores_codex":[0.9986569,0.00007451565,0.0004252288,0.0004310184,0.0001579326,0.0002543704],"domain_scores_gemma":[0.9990821,0.00005423243,0.0002809837,0.0002967929,0.0001524852,0.0001333964],"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.00006166081,0.00101869,0.01588081,0.0004799373,0.0003245743,0.00001059552,0.0236057,0.2339273,0.0001267943,0.6695105,0.0007140328,0.0543394],"study_design_scores_gemma":[0.001204012,0.0001027157,0.006202034,0.00005651707,0.00002069129,0.000008559285,0.00009928778,0.9896084,0.00002122047,0.000561714,0.00187747,0.0002373763],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001669636,0.00008535547,0.9926186,0.0000881107,0.003618152,0.001410132,0.000009302943,0.0002428286,0.0002578588],"genre_scores_gemma":[0.7118708,0.00006046599,0.2874157,0.000104266,0.0001070168,0.0002007259,0.00002975532,0.00001902385,0.0001922338],"genre_candidate":"methods","genre_consensus":null,"teacher_disagreement_score":0.7556811,"threshold_uncertainty_score":0.7292075,"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."}}