{"id":"W2079808644","doi":"10.1109/icassp.2014.6855022","title":"Channel-aware distributed dynamic spectrum access via learning-based heterogeneous multi-channel auction","year":2014,"lang":"en","type":"article","venue":"","topic":"Advanced Bandit Algorithms Research","field":"Decision Sciences","cited_by":2,"is_retracted":false,"has_abstract":true,"ca_institutions":"Ontario Tech University","funders":"","keywords":"Computer science; Channel (broadcasting); Throughput; Overhead (engineering); Diversity gain; Auction algorithm; Computer network; Spectrum auction; Auction theory; Wireless; Common value auction; Telecommunications; Revenue equivalence; Fading; 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":[{"model":"gemma","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"empirical","about_ca_system":false,"about_ca_topic":false,"confidence":"low","status":"direct model label, unvalidated"},{"model":"gpt","categories":[],"domain":null,"study_design":"simulation_or_modeling","genre":"methods","about_ca_system":false,"about_ca_topic":false,"confidence":"low","status":"direct model label, unvalidated"}],"prediction":{"model_version":"codex-gemma-dda1882f352a","candidate_categories":["metaepi_narrow","insufficient_payload"],"consensus_categories":["insufficient_payload"],"category_scores_codex":[0.001808243,0.000361216,0.0004856283,0.0006221912,0.0005783292,0.0006027175,0.001572677,0.0001980019,0.0009735747],"category_scores_gemma":[0.002140034,0.0002783328,0.0002298432,0.001486473,0.0002438017,0.0006874581,0.0004385198,0.0005459018,0.001066694],"about_ca_system_candidate":false,"about_ca_system_consensus":false,"about_ca_system_score_codex":0.0002648014,"about_ca_system_score_gemma":0.00008020997,"about_ca_topic_candidate":false,"about_ca_topic_consensus":false,"about_ca_topic_score_codex":0.0001438738,"about_ca_topic_score_gemma":0.0006811828,"domain_scores_codex":[0.9946609,0.0005327144,0.0007186524,0.001150291,0.00203731,0.0009001284],"domain_scores_gemma":[0.9968663,0.000989679,0.000314241,0.0009022981,0.0005545812,0.0003728463],"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.00005838163,0.000114326,0.00002861784,0.000005824117,0.00001282102,0.00001747727,0.00002748461,0.9982706,0.00000868436,1.409728e-7,0.0001948225,0.001260866],"study_design_scores_gemma":[0.001035294,0.0002604056,0.002002264,0.00001049355,0.000006412433,0.00002700638,0.00008125337,0.9862039,0.004785349,0.003160837,0.002071443,0.0003553459],"study_design_candidate":"simulation_or_modeling","study_design_consensus":"simulation_or_modeling","genre_codex":"methods","genre_gemma":"empirical","genre_scores_codex":[0.001376702,0.00003041084,0.9957613,0.00132415,0.0006691387,0.0004252428,0.0000528001,0.0003537648,0.000006471488],"genre_scores_gemma":[0.9967363,0.00000803488,0.00009675386,0.0001214249,0.0001607801,0.00005432001,0.000141532,0.00005036448,0.002630519],"genre_candidate":"empirical","genre_consensus":null,"teacher_disagreement_score":0.9956645,"threshold_uncertainty_score":0.9999669,"prediction_status":"machine_predicted_unvalidated"},"machine_scores":{"provisional":true,"baseline":true,"maturity_gate_passed":false,"score_opus":0.07850233049752461,"score_gpt":0.4113892746801949,"score_spread":0.3328869441826703,"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."}}