{"id":"W2153122315","doi":"10.1007/s10479-012-1148-8","title":"Approximately optimal bidding policies for repeated first-price auctions","year":2012,"lang":"en","type":"article","venue":"Annals of Operations Research","topic":"Auction Theory and Applications","field":"Decision Sciences","cited_by":1,"is_retracted":false,"has_abstract":false,"ca_institutions":"McGill University","funders":"","keywords":"Bidding; Common value auction; Theory of computation; Payment; Microeconomics; Bounded rationality; Rationality; Computer science; Real-time bidding; Mathematical optimization; Mathematical economics; Combinatorial auction; Economics; Operations research; Mathematics; Finance; Algorithm","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.007367827,0.001315925,0.003575616,0.001037767,0.0007130009,0.004328951,0.002718843,0.002440009,0.00328006],"category_scores_gemma":[0.0427805,0.001598682,0.001086474,0.001336115,0.001449354,0.005173002,0.001310822,0.002616982,0.0004912518],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.00264153,"about_ca_system_score_gemma":0.004068806,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.002733664,"about_ca_topic_score_gemma":0.002481654,"domain_scores_codex":[0.9956692,0.002467146,0.0002411907,0.000386037,0.0005981369,0.0006382429],"domain_scores_gemma":[0.9692293,0.02482748,0.002250326,0.001541115,0.001343417,0.0008084269],"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.000746752,0.0004076984,0.001186806,0.0002065303,0.0001528477,0.0001095469,0.0002379386,0.8828389,0.001802399,0.084461,0.002092473,0.0257571],"study_design_scores_gemma":[0.0001005463,0.00007516738,0.0002299218,0.00001656552,0.00002164385,0.00003979289,0.00003518333,0.937144,0.000296375,0.0618181,0.0002042318,0.00001837515],"study_design_candidate":"theoretical_or_conceptual","study_design_consensus":null,"genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.2205482,0.001250911,0.7680233,0.001491039,0.0001192965,0.0002714089,0.0003085284,0.000409151,0.007578227],"genre_scores_gemma":[0.923082,0.000781678,0.07159098,0.000173424,0.0001376537,0.0002466199,0.0002406285,0.0001378459,0.003609286],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.007367827,"threshold_uncertainty_score":0.03896523,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.7247939710833537,"score_gpt":0.613052658155607,"score_spread":0.1117413129277467,"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."}}