{"id":"W2621304102","doi":"10.1145/2049697.2049699","title":"Truthful and Near-Optimal Mechanism Design via Linear Programming","year":2011,"lang":"en","type":"article","venue":"Journal of the ACM","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":122,"is_retracted":false,"has_abstract":true,"ca_institutions":"University of Waterloo","funders":"Natural Sciences and Engineering Research Council of Canada","keywords":"Knapsack problem; Combinatorial auction; Approximation algorithm; Mathematical optimization; Relaxation (psychology); Mathematics; Maximization; Common value auction; Computer science","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":[],"consensus_categories":[],"category_scores_codex":[0.002813811,0.0000604043,0.0001261503,0.00005146918,0.000264403,0.00008217016,0.001404099,0.00003885234,0.000201875],"category_scores_gemma":[0.002326732,0.00003122502,0.00009997094,0.0002484757,0.0001113291,0.0002196111,0.0002648044,0.0001687364,0.00005398213],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.000008567989,"about_ca_system_score_gemma":0.00003934191,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.000001643811,"about_ca_topic_score_gemma":3.026604e-7,"domain_scores_codex":[0.9988415,0.0001838683,0.0003822647,0.00009878792,0.0003939369,0.0000996275],"domain_scores_gemma":[0.9982791,0.0003717665,0.0004766809,0.0006098733,0.000183148,0.00007943108],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"design_other","study_design_gemma":"theoretical_or_conceptual","study_design_scores_codex":[0.001274402,0.0008491106,0.003558846,0.00001085808,0.0003102595,0.00005323194,0.02570526,0.001880984,0.02843556,0.1032428,0.01748443,0.8171942],"study_design_scores_gemma":[0.0002784527,0.000198505,0.001714404,0.00001190099,0.00004010226,0.0004802919,0.0009571498,0.001683728,0.02036363,0.9608679,0.01331797,0.00008595129],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.3678156,0.0000713177,0.6288337,0.002449851,0.0004137127,0.0001536981,8.824645e-7,0.0000110109,0.0002502749],"genre_scores_gemma":[0.7836381,0.000004453667,0.2156325,0.0001202779,0.0001147153,0.000002061302,1.672618e-8,0.000005033699,0.0004828157],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.8576251,"threshold_uncertainty_score":0.2785484,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1952216190230927,"score_gpt":0.3618107105756824,"score_spread":0.1665890915525898,"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."}}