{"id":"W3099113914","doi":"10.5267/j.dsl.2020.10.007","title":"Optimizing bid search in large outcome spaces for automated multi-issue negotiations using meta-heuristic methods","year":2020,"lang":"en","type":"article","venue":"Decision Science Letters","topic":"Multi-Agent Systems and Negotiation","field":"Computer Science","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"","funders":"","keywords":"Bidding; Negotiation; Outcome (game theory); Computer science; Incremental heuristic search; Heuristic; Beam search; Iterative deepening depth-first search; Mathematical optimization; Search algorithm; Baseline (sea); Operations research; Artificial intelligence; Algorithm; Mathematics; Microeconomics; Economics","routes":{"ca_aff":false,"ca_fund":false,"ca_venue":true,"about_ca":false,"invisible_to_affiliation_only":true},"retraction":null,"screen":null,"direct_labels":[],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.004502469,0.0002220017,0.0004687431,0.0006717477,0.0005164308,0.0007459716,0.001527297,0.0000628565,0.0000221884],"category_scores_gemma":[0.001643643,0.0001828212,0.0001769032,0.002951837,0.0001011027,0.001576836,0.0004306659,0.0001736068,0.00004652188],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001472673,"about_ca_system_score_gemma":0.0001022638,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000080671,"about_ca_topic_score_gemma":0.0000097817,"domain_scores_codex":[0.9964902,0.0002806735,0.0007345356,0.0009517101,0.000884311,0.0006586055],"domain_scores_gemma":[0.997871,0.0009180132,0.0002308781,0.0005504617,0.0001728739,0.0002567932],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"bench_or_experimental","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00003042249,0.0002112314,0.01145658,0.0001007583,0.0001043494,0.00004963125,0.01624915,0.4021352,0.5550374,0.002681144,0.001555983,0.01038822],"study_design_scores_gemma":[0.0006469714,0.00002280038,0.00501696,0.00001777042,0.00002784073,0.000003686678,0.0001299116,0.9896693,0.003369681,0.00001689713,0.000865432,0.0002127469],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.06378677,0.00007086575,0.9285588,0.006081983,0.0006365124,0.0006047034,0.000009533519,0.0002435195,0.00000726527],"genre_scores_gemma":[0.3479894,0.000001499123,0.64932,0.002605325,0.00004397583,0.00002216131,0.000001468195,0.00001029313,0.000005860479],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.5875341,"threshold_uncertainty_score":0.7455232,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2855269485146071,"score_gpt":0.4720112811950905,"score_spread":0.1864843326804834,"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."}}