{"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":"codex-gemma-dda1882f352a","candidate_categories":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.02048718,0.00008157297,0.0001740971,0.0007085691,0.000325228,0.0004193699,0.0006773993,0.00001961688,0.001839125],"category_scores_gemma":[0.002285931,0.00005992624,0.00007604631,0.001239628,0.0001174177,0.000723505,0.000136552,0.0006494343,0.001573204],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0001337866,"about_ca_system_score_gemma":0.0003822597,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001714404,"about_ca_topic_score_gemma":7.740424e-7,"domain_scores_codex":[0.9942341,0.002099402,0.0008957775,0.0002460757,0.002303171,0.0002214105],"domain_scores_gemma":[0.9962276,0.000938898,0.0002117903,0.000241902,0.002256384,0.0001233995],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"not_applicable","study_design_scores_codex":[0.0006542646,0.000820576,0.007071586,0.000007561879,0.00005366839,0.00007614827,0.005495477,0.1185411,0.02134942,0.8156996,0.02338157,0.006848948],"study_design_scores_gemma":[0.009736082,0.004435514,0.109122,0.0004070399,0.00001714696,0.0005540626,0.01864659,0.01295808,0.02200157,0.1448667,0.6764328,0.0008223714],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"empirical","genre_gemma":"empirical","genre_scores_codex":[0.9108717,0.00008379982,0.02187114,0.004926994,0.0009012371,0.0005022949,0.000007121597,0.000009589332,0.06082607],"genre_scores_gemma":[0.9907687,0.000007323277,0.002054481,0.00005718897,0.0004621733,0.000005370169,0.000002069287,0.0000105759,0.006632158],"genre_candidate":"empirical","genre_consensus":"empirical","teacher_disagreement_score":0.670833,"threshold_uncertainty_score":0.9992042,"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."}}