{"id":"W3005536528","doi":"10.1109/ictai.2019.00031","title":"Automated Mechanism Design: Compact and Decomposition Linear Programming Models","year":2019,"lang":"en","type":"article","venue":"","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":true,"ca_institutions":"Concordia University","funders":"","keywords":"Decomposition; Computer science; Context (archaeology); Mathematical optimization; Linear programming; Polynomial; Mechanism (biology); Exponential function; Algorithm; Theoretical computer science; Mathematics","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.002562302,0.001268879,0.001366766,0.0008215502,0.0003901534,0.002313588,0.001610159,0.001854111,0.003910412],"category_scores_gemma":[0.01050081,0.001016861,0.001436137,0.001357288,0.001398066,0.002987103,0.00173879,0.002787545,0.0006331973],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.001462986,"about_ca_system_score_gemma":0.001108212,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002150241,"about_ca_topic_score_gemma":0.001863738,"domain_scores_codex":[0.9978092,0.001218132,0.00008207049,0.0002832057,0.0004398203,0.0001674987],"domain_scores_gemma":[0.99437,0.004012885,0.0005926455,0.0005925387,0.0002822314,0.0001495647],"domain_codex":null,"domain_gemma":null,"domain_candidate":null,"domain_consensus":null,"study_design_codex":"simulation_or_modeling","study_design_gemma":"simulation_or_modeling","study_design_scores_codex":[0.00007166739,0.00009559886,0.0002078346,0.00006779944,0.00002734657,0.00005418108,0.00009134015,0.8584774,0.0004970772,0.123352,0.0008433381,0.01621439],"study_design_scores_gemma":[0.00002130946,0.00002116225,0.00002666532,0.000009224678,0.000004540323,0.000012748,0.000007148716,0.9453498,0.00009666066,0.05386414,0.0005830444,0.00000353796],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.01706836,0.0004150573,0.9784399,0.0002978825,0.00002076768,0.00006874998,0.0001206066,0.0002040136,0.003364705],"genre_scores_gemma":[0.550702,0.0009323384,0.4390928,0.0001580057,0.00008801676,0.0006651973,0.0004421469,0.000147596,0.007771818],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.003910412,"threshold_uncertainty_score":0.01355088,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.1258779519315885,"score_gpt":0.4113328522456651,"score_spread":0.2854549003140766,"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."}}