{"id":"W2549743857","doi":"10.1145/3055399.3055465","title":"Simple mechanisms for subadditive buyers via duality","year":2017,"lang":"en","type":"article","venue":"","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":109,"is_retracted":false,"has_abstract":true,"ca_institutions":"McGill University","funders":"Fonds de recherche du Québec – Nature et technologies; Natural Sciences and Engineering Research Council of Canada","keywords":"Subadditivity; Revenue; Simple (philosophy); Incentive compatibility; Mechanism design; Computer science; Benchmark (surveying); Revenue management; Upper and lower bounds; Incentive; Bayesian probability; Mathematical economics; Duality (order theory); Submodular set function; Competitive analysis; Mathematical optimization; Mathematics; Microeconomics; Combinatorics; Economics; Artificial intelligence; Finance","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.001799844,0.00006623417,0.0001205231,0.00003634274,0.001242052,0.0002761706,0.0007131587,0.00004411327,0.003008521],"category_scores_gemma":[0.001762609,0.00004680772,0.0001001187,0.00006216882,0.0001255961,0.0003313595,0.00009459785,0.00003863245,0.0008102679],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00001107825,"about_ca_system_score_gemma":0.00002030836,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.00003070769,"about_ca_topic_score_gemma":0.00005706844,"domain_scores_codex":[0.998971,0.00004601201,0.0002401708,0.0003059924,0.0002996016,0.0001371834],"domain_scores_gemma":[0.997752,0.0008024808,0.0002368924,0.0008943155,0.0002344211,0.00007985863],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"theoretical_or_conceptual","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.000015325,0.00002242095,0.00006897879,4.216335e-7,0.000005541607,1.475952e-7,0.00006719987,0.000004985902,0.001228265,0.9515744,0.01941345,0.02759889],"study_design_scores_gemma":[0.0001365298,0.00001879018,0.001956753,3.752919e-7,0.000003888969,0.000001010911,0.0006030155,0.0005828657,0.01984406,0.8941432,0.08264241,0.00006708745],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":"theoretical_or_conceptual","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.00742756,9.584778e-7,0.9565873,0.002089967,0.0001819144,0.0002531781,0.0001043311,0.00004094301,0.03331388],"genre_scores_gemma":[0.9789026,4.006278e-7,0.004387587,0.000380812,0.00007831462,0.00008789752,0.000007573265,0.000004627627,0.01615018],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9714751,"threshold_uncertainty_score":0.9999677,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1865759634444359,"score_gpt":0.469180565225534,"score_spread":0.282604601781098,"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."}}