{"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":"metacan-v3-hybrid-931329e0061c","candidate_categories":[],"consensus_categories":[],"category_scores_codex":[0.002584473,0.001471502,0.001199607,0.000555593,0.0004722409,0.003254427,0.001745481,0.001067069,0.004797445],"category_scores_gemma":[0.009906142,0.0008481446,0.0009068154,0.001327487,0.001201489,0.004250234,0.001904716,0.002270486,0.001092095],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0009140378,"about_ca_system_score_gemma":0.001983678,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.001312423,"about_ca_topic_score_gemma":0.002396251,"domain_scores_codex":[0.9974837,0.001194711,0.0001984573,0.0002713562,0.0006207525,0.0002309782],"domain_scores_gemma":[0.9954122,0.003375577,0.0003705631,0.0003910818,0.0003585584,0.00009201351],"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.0002124887,0.0004020602,0.0006130651,0.0008508311,0.00007880372,0.0004306776,0.0005334565,0.5145708,0.006507982,0.3349607,0.007537885,0.1333012],"study_design_scores_gemma":[0.0001477158,0.0001222387,0.0001077882,0.00005738414,0.00004292094,0.0001354166,0.0002271178,0.7751284,0.003624463,0.2128526,0.007530669,0.00002331765],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01873303,0.0002606361,0.9745059,0.0005744025,0.00004479476,0.0001675136,0.000304854,0.0007508037,0.004658085],"genre_scores_gemma":[0.2370286,0.0008332845,0.7539268,0.0002907022,0.0001144706,0.0006187533,0.001238153,0.000303367,0.005645998],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.004797445,"threshold_uncertainty_score":0.01604909,"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."}}