{"id":"W2076064295","doi":"10.5555/777092.777150","title":"Solving concisely expressed combinatorial auction problems","year":2002,"lang":"en","type":"article","venue":"","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":46,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Toronto","funders":"","keywords":"Combinatorial auction; Computer science; Bidding; Complementarity (molecular biology); Mathematical optimization; Exploit; Common value auction; Set (abstract data type); Linear programming; Theoretical computer science; Algorithm; Mathematics; Programming language","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":["insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.0009023884,0.0000822077,0.0001257888,0.00009209984,0.0003325432,0.000189903,0.0003663832,0.00006128992,0.01167683],"category_scores_gemma":[0.000529597,0.00006166263,0.0000677693,0.0005028035,0.00009295944,0.0003999525,0.00005058016,0.00009253393,0.003593535],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001812983,"about_ca_system_score_gemma":0.000007533615,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000008413496,"about_ca_topic_score_gemma":0.000002144697,"domain_scores_codex":[0.9984621,0.0001023081,0.0003873339,0.0003248818,0.0005705638,0.0001527576],"domain_scores_gemma":[0.9987178,0.0004347437,0.0001432339,0.000421187,0.0001962799,0.00008676169],"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.00001883601,0.0003343443,0.000496304,0.00000341898,0.00001639734,0.000001227076,0.001886646,0.001118101,0.01584879,0.655973,0.2302014,0.09410147],"study_design_scores_gemma":[0.0005775845,0.00004223009,0.0002417949,0.000004005683,0.000006195039,0.000007540509,0.0007527561,0.01123243,0.007010307,0.4687453,0.5112033,0.0001765939],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"other","genre_gemma":"empirical","genre_scores_codex":[0.1424334,0.00008509351,0.2569418,0.005067703,0.003845061,0.0007643173,0.00001282376,0.0006412343,0.5902086],"genre_scores_gemma":[0.9793988,0.00001091936,0.0004074198,0.0001204925,0.0002384109,0.00004423978,0.000001083385,0.000006333428,0.0197723],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8369654,"threshold_uncertainty_score":0.9971823,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1462775382160784,"score_gpt":0.3444162390615983,"score_spread":0.1981387008455199,"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."}}