{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,17]],"date-time":"2025-09-17T14:52:40Z","timestamp":1758120760073,"version":"3.28.0"},"reference-count":21,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015,9]]},"DOI":"10.1109\/allerton.2015.7447154","type":"proceedings-article","created":{"date-parts":[[2016,4,20]],"date-time":"2016-04-20T16:58:11Z","timestamp":1461171491000},"page":"1272-1279","source":"Crossref","is-referenced-by-count":7,"title":["Asymptotically optimal distributed channel allocation: A competitive game-theoretic approach"],"prefix":"10.1109","author":[{"given":"Ilai","family":"Bistritz","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Amir","family":"Leshem","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/DYSPAN.2005.1542622"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/DYSPAN.2005.1542643"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TCOMM.2005.852826"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2008.080906"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICDSP.2011.6004987"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.2307\/1969529"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1080\/01621459.1963.10500830"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1002\/rsa.20427"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1948-09098-X"},{"journal-title":"Game theoretic dynamic spectrum allocations for frequency-selective interference channels","year":"0","author":"bistritz","key":"ref19"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2013.2285512"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/ICDSP.2013.6622738"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02186476"},{"key":"ref5","article-title":"Expected time complexity of the auction algorithm and the push relabel algorithm for maximum bipartite matching on random graphs","author":"naparstek","year":"2014","journal-title":"Random Structures & Algorithms"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/MSP.2009.933370"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2012.120108"},{"journal-title":"Combinatorial Optimization Algorithms and Complexity","year":"1998","author":"papadimitriou","key":"ref2"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2002.1007390"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/JSAC.2008.080907"},{"key":"ref20","first-page":"374","article-title":"Iterative solution of games by fictitious play","volume":"13","author":"brown","year":"1951","journal-title":"Activity Analysis of Production and Allocation"},{"article-title":"Learning in games","year":"0","author":"levin","key":"ref21"}],"event":{"name":"2015 53rd Annual Allerton Conference on Communication, Control and Computing (Allerton)","start":{"date-parts":[[2015,9,29]]},"location":"Monticello, IL","end":{"date-parts":[[2015,10,2]]}},"container-title":["2015 53rd Annual Allerton Conference on Communication, Control, and Computing (Allerton)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/7444067\/7446973\/07447154.pdf?arnumber=7447154","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,17]],"date-time":"2017-03-17T13:53:49Z","timestamp":1489758829000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/7447154\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,9]]},"references-count":21,"URL":"https:\/\/doi.org\/10.1109\/allerton.2015.7447154","relation":{},"subject":[],"published":{"date-parts":[[2015,9]]}}}