{"id":"W1523443811","doi":"10.1007/978-3-540-24840-8_32","title":"A Decision-Theoretic Algorithm for Bundle Purchasing in Multiple Open Ascending-Price Auctions","year":2004,"lang":"en","type":"book-chapter","venue":"Lecture notes in computer science","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":false,"ca_institutions":"National Research Council Canada","funders":"","keywords":"Bidding; Common value auction; Markov decision process; Computer science; Mathematical optimization; Bundle; Purchasing; State space; Ebidding; Dynamic programming; Value (mathematics); Operations research; Markov process; Algorithm; Microeconomics; Economics; Mathematics; Machine learning; Operations management","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.003855107,0.001241472,0.003501094,0.00116597,0.00158575,0.00426664,0.004764002,0.003160377,0.011688],"category_scores_gemma":[0.009243684,0.001500853,0.001759248,0.00283344,0.001371768,0.005387613,0.004260597,0.003398774,0.002401279],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.002021361,"about_ca_system_score_gemma":0.003641724,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002499622,"about_ca_topic_score_gemma":0.002845634,"domain_scores_codex":[0.9968197,0.00100162,0.0002653945,0.0006016231,0.000906035,0.000405552],"domain_scores_gemma":[0.9952042,0.003177343,0.0002231262,0.0005691336,0.0005611072,0.0002650549],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.001078309,0.0009190334,0.0009672469,0.0003226619,0.0001556584,0.0001618962,0.000333453,0.3293429,0.003004768,0.1146503,0.01161275,0.537451],"study_design_scores_gemma":[0.0002305646,0.00009610344,0.0001197888,0.00001841505,0.00002988185,0.0000869475,0.00004132033,0.9025441,0.0007236289,0.09483631,0.001250105,0.00002277458],"study_design_candidate":"simulation_or_modeling","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"methods","genre_scores_codex":[0.01162525,0.0001287433,0.9830248,0.0002552553,0.00006569172,0.000186778,0.00008155135,0.0007786424,0.003853255],"genre_scores_gemma":[0.1259655,0.0001378877,0.8687883,0.0001347218,0.00009448737,0.0003734757,0.0003164766,0.0001639836,0.004025056],"genre_candidate":"methods","genre_consensus":"methods","teacher_disagreement_score":0.011688,"threshold_uncertainty_score":0.03910023,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07059011920852305,"score_gpt":0.363892282680755,"score_spread":0.293302163472232,"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."}}