Stochastic Games on a Multiple Access Channel
We consider a scenario where N users try to access a common base station. Associated with each user is its channel state and a finite queue which varies with time. Each user chooses his power and the admission control variable in a dynamic manner so as to maximize his expected throughput. The throug...
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Artikel |
| Sprache: | eng |
| Schlagworte: | |
| Online-Zugang: | Volltext bestellen |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| container_end_page | |
|---|---|
| container_issue | |
| container_start_page | |
| container_title | |
| container_volume | |
| creator | Narayanan, Prashant Sharma, Vinod |
| description | We consider a scenario where N users try to access a common base station.
Associated with each user is its channel state and a finite queue which varies
with time. Each user chooses his power and the admission control variable in a
dynamic manner so as to maximize his expected throughput. The throughput of
each user is a function of the actions and states of all users. The scenario
considers the situation where each user knows his channel and buffer state but
is unaware of the states and actions taken by the other users. We consider the
scenario when each user is saturated (i.e., always has a packet to transmit) as
well as the case when each user is unsaturated. We formulate the problem as a
Markov game and show connections with strategic form games. We then consider
various throughput functions associated with the multiple user channel and
provide algorithms for finding these equilibria. |
| doi_str_mv | 10.48550/arxiv.1210.7859 |
| format | Article |
| fullrecord | <record><control><sourceid>arxiv_GOX</sourceid><recordid>TN_cdi_arxiv_primary_1210_7859</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>1210_7859</sourcerecordid><originalsourceid>FETCH-LOGICAL-a659-b23620c0099135aa2dfcfbc63bca8047d8bad07b9b528be9658bddecb09cf15d3</originalsourceid><addsrcrecordid>eNotzjsLwjAUhuEsDlLdnSR_oJompk1GKd5AcdC9nHOSYqFWaarov_c6ffAOHw9jo0RMZkZrMYX2Ud0niXyHzGjbZ_Ghu9AJQlcRX8HZB35pOPDdre6qa-35nMiHwPMTNI2vB6xXQh388L8ROy4Xx3wdb_erTT7fxpBqG6NUqRQkhLWJ0gDSlVQipQoJjJhlziA4kaFFLQ16m2qDznlCYalMtFMRG_9uv9zi2lZnaJ_Fh1182OoFtXk8wA</addsrcrecordid><sourcetype>Open Access Repository</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype></control><display><type>article</type><title>Stochastic Games on a Multiple Access Channel</title><source>arXiv.org</source><creator>Narayanan, Prashant ; Sharma, Vinod</creator><creatorcontrib>Narayanan, Prashant ; Sharma, Vinod</creatorcontrib><description>We consider a scenario where N users try to access a common base station.
Associated with each user is its channel state and a finite queue which varies
with time. Each user chooses his power and the admission control variable in a
dynamic manner so as to maximize his expected throughput. The throughput of
each user is a function of the actions and states of all users. The scenario
considers the situation where each user knows his channel and buffer state but
is unaware of the states and actions taken by the other users. We consider the
scenario when each user is saturated (i.e., always has a packet to transmit) as
well as the case when each user is unsaturated. We formulate the problem as a
Markov game and show connections with strategic form games. We then consider
various throughput functions associated with the multiple user channel and
provide algorithms for finding these equilibria.</description><identifier>DOI: 10.48550/arxiv.1210.7859</identifier><language>eng</language><subject>Computer Science - Computer Science and Game Theory ; Computer Science - Systems and Control</subject><creationdate>2012-10</creationdate><rights>http://arxiv.org/licenses/nonexclusive-distrib/1.0</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>228,230,776,881</link.rule.ids><linktorsrc>$$Uhttps://arxiv.org/abs/1210.7859$$EView_record_in_Cornell_University$$FView_record_in_$$GCornell_University$$Hfree_for_read</linktorsrc><backlink>$$Uhttps://doi.org/10.48550/arXiv.1210.7859$$DView paper in arXiv$$Hfree_for_read</backlink></links><search><creatorcontrib>Narayanan, Prashant</creatorcontrib><creatorcontrib>Sharma, Vinod</creatorcontrib><title>Stochastic Games on a Multiple Access Channel</title><description>We consider a scenario where N users try to access a common base station.
Associated with each user is its channel state and a finite queue which varies
with time. Each user chooses his power and the admission control variable in a
dynamic manner so as to maximize his expected throughput. The throughput of
each user is a function of the actions and states of all users. The scenario
considers the situation where each user knows his channel and buffer state but
is unaware of the states and actions taken by the other users. We consider the
scenario when each user is saturated (i.e., always has a packet to transmit) as
well as the case when each user is unsaturated. We formulate the problem as a
Markov game and show connections with strategic form games. We then consider
various throughput functions associated with the multiple user channel and
provide algorithms for finding these equilibria.</description><subject>Computer Science - Computer Science and Game Theory</subject><subject>Computer Science - Systems and Control</subject><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2012</creationdate><recordtype>article</recordtype><sourceid>GOX</sourceid><recordid>eNotzjsLwjAUhuEsDlLdnSR_oJompk1GKd5AcdC9nHOSYqFWaarov_c6ffAOHw9jo0RMZkZrMYX2Ud0niXyHzGjbZ_Ghu9AJQlcRX8HZB35pOPDdre6qa-35nMiHwPMTNI2vB6xXQh388L8ROy4Xx3wdb_erTT7fxpBqG6NUqRQkhLWJ0gDSlVQipQoJjJhlziA4kaFFLQ16m2qDznlCYalMtFMRG_9uv9zi2lZnaJ_Fh1182OoFtXk8wA</recordid><startdate>20121029</startdate><enddate>20121029</enddate><creator>Narayanan, Prashant</creator><creator>Sharma, Vinod</creator><scope>AKY</scope><scope>GOX</scope></search><sort><creationdate>20121029</creationdate><title>Stochastic Games on a Multiple Access Channel</title><author>Narayanan, Prashant ; Sharma, Vinod</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-a659-b23620c0099135aa2dfcfbc63bca8047d8bad07b9b528be9658bddecb09cf15d3</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2012</creationdate><topic>Computer Science - Computer Science and Game Theory</topic><topic>Computer Science - Systems and Control</topic><toplevel>online_resources</toplevel><creatorcontrib>Narayanan, Prashant</creatorcontrib><creatorcontrib>Sharma, Vinod</creatorcontrib><collection>arXiv Computer Science</collection><collection>arXiv.org</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Narayanan, Prashant</au><au>Sharma, Vinod</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Stochastic Games on a Multiple Access Channel</atitle><date>2012-10-29</date><risdate>2012</risdate><abstract>We consider a scenario where N users try to access a common base station.
Associated with each user is its channel state and a finite queue which varies
with time. Each user chooses his power and the admission control variable in a
dynamic manner so as to maximize his expected throughput. The throughput of
each user is a function of the actions and states of all users. The scenario
considers the situation where each user knows his channel and buffer state but
is unaware of the states and actions taken by the other users. We consider the
scenario when each user is saturated (i.e., always has a packet to transmit) as
well as the case when each user is unsaturated. We formulate the problem as a
Markov game and show connections with strategic form games. We then consider
various throughput functions associated with the multiple user channel and
provide algorithms for finding these equilibria.</abstract><doi>10.48550/arxiv.1210.7859</doi><oa>free_for_read</oa></addata></record> |
| fulltext | fulltext_linktorsrc |
| identifier | DOI: 10.48550/arxiv.1210.7859 |
| ispartof | |
| issn | |
| language | eng |
| recordid | cdi_arxiv_primary_1210_7859 |
| source | arXiv.org |
| subjects | Computer Science - Computer Science and Game Theory Computer Science - Systems and Control |
| title | Stochastic Games on a Multiple Access Channel |
| url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-22T09%3A58%3A33IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-arxiv_GOX&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Stochastic%20Games%20on%20a%20Multiple%20Access%20Channel&rft.au=Narayanan,%20Prashant&rft.date=2012-10-29&rft_id=info:doi/10.48550/arxiv.1210.7859&rft_dat=%3Carxiv_GOX%3E1210_7859%3C/arxiv_GOX%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rfr_iscdi=true |