{"id":"W2935359384","doi":"10.1016/j.ejor.2019.03.043","title":"Optimal pricing in iterative flexible combinatorial procurement auctions","year":2019,"lang":"en","type":"article","venue":"European Journal of Operational Research","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":12,"is_retracted":false,"has_abstract":false,"ca_institutions":"McMaster University; Saint Mary's University","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Combinatorial auction; Procurement; Bidding; Computer science; Profit maximization; Mathematical optimization; Profit (economics); Common value auction; Maximization; Microeconomics; Economics; Mathematics; Business; Marketing","routes":{"ca_aff":true,"ca_fund":true,"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.00517255,0.000895651,0.002391564,0.001135774,0.001030311,0.004415522,0.003010272,0.002349179,0.004250525],"category_scores_gemma":[0.03058284,0.001596449,0.001403907,0.001946143,0.002123488,0.004310939,0.002153225,0.001944753,0.0003715032],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001902495,"about_ca_system_score_gemma":0.002390242,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.003510155,"about_ca_topic_score_gemma":0.002569766,"domain_scores_codex":[0.9961422,0.002284258,0.0001588332,0.0002769292,0.0005988508,0.0005388447],"domain_scores_gemma":[0.9820843,0.01497525,0.0009347536,0.0006819327,0.0008684564,0.0004553449],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.0002934241,0.000192363,0.0009171002,0.0001449336,0.00007926466,0.0001657786,0.0002300405,0.8732963,0.001105015,0.09919642,0.0006728629,0.02370642],"study_design_scores_gemma":[0.00003398619,0.00004864282,0.0001516528,0.000011556,0.00001763337,0.00004215458,0.00003874554,0.9447032,0.0002454438,0.0545438,0.0001510934,0.00001214353],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2064703,0.0003965984,0.7768714,0.0005111047,0.00005428559,0.0001455609,0.00005439285,0.0001716236,0.01532483],"genre_scores_gemma":[0.9324049,0.0002519589,0.06332666,0.00005077283,0.00003827705,0.0001329054,0.0000513675,0.00007170544,0.00367157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.00517255,"threshold_uncertainty_score":0.02735537,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.2305701067503219,"score_gpt":0.4808177678794179,"score_spread":0.250247661129096,"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."}}