A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
Filters
Rate Adaptation Games in Wireless LANs: Nash Equilibrium and Price of Anarchy
2010
2010 Proceedings IEEE INFOCOM
Preserved Fulltext
We show that the Nash Equilibrium realized in the case of competition can be inefficient (i.e., the price of anarchy is high, up to 50% of the social optimum), and provide insightful properties of the ...
In Wireless LANs, users may adapt their transmission rates depending on the observed radio conditions on their links to maximize their throughput. ...
In the competitive scenario, we are also interested in identifying slight modifications of the DCF scheme that could eliminate the price of anarchy, and push the Nash Equilibria of the rate adaptation ...
doi:10.1109/infcom.2010.5462028
dblp:conf/infocom/RadunovicCP10
fatcat:pbd2eklcjreftefj34mw5re5ye
Joint Rate Adaptation and Medium Access in Wireless LANs: a Non-cooperative Game Theoretic Perspective
[article]
2012
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
A systematic analysis is conducted on the structural properties of the game to provide insights on the interaction between rate adaptation and 802.11 medium access control in a competitive setting. ...
We model the interactions among selfish users under the adapted TFT framework as a non-cooperative joint medium access and rate adaptation game. ...
For each N , we run 100 simulations with random SNR and plot the average Price of Anarchy in Figure 6 . ...
arXiv:1207.4258v1
fatcat:jlmco3avrzegdbu5bawoxi3ct4
Distributed Opportunistic Scheduling for Ad Hoc Networks With Random Access: An Optimal Stopping Approach
2009
IEEE Transactions on Information Theory
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2016; you can also visit the original URL.
The file type is application/pdf.
We explore the existence and uniqueness of the Nash equilibrium, and show that the Nash equilibrium can be approached by the best response strategy. ...
Because there is an efficiency loss at the Nash equilibrium, we then study pricing-based mechanisms to mitigate the loss. ...
Srikant for his insightful suggestions to introduce pricing mechanisms for studying the user-centric case. ...
doi:10.1109/tit.2008.2008137
fatcat:f223vd26dvc3rj3pgce3zjfb7i
Distributed learning for utility maximization over CSMA-based wireless multihop networks
2014
IEEE INFOCOM 2014 - IEEE Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The most significant part of our approach lies in introducing a novel cost function in agents' utilities so that the proposed game admits an ordinal potential function with (asymptotically) no price-of-anarchy ...
The game formulation naturally leads to known game-based learning rules to find a Nash equilibrium, but they are computationally inefficient and often require global information. ...
Equilibrium Analysis: Existence, Uniqueness and Price-of-Anarchy We now analyze the equilibrium of oCSMA(β) using the popular notion of Nash equilibrium, whose definition is presented as follows: Definition ...
doi:10.1109/infocom.2014.6847949
dblp:conf/infocom/JangYSY14
fatcat:e3vqidf6hncqhki4el6yvfzdge
Cooperative Game Theory and the Gaussian Interference Channel
2008
IEEE Journal on Selected Areas in Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper we discuss the use of cooperative game theory for analyzing interference channels. ...
We extend our previous work, to games with N players as well as frequency selective channels and joint TDM/FDM strategies. ...
ACKNOWLEDGEMENT We would like to thank the anonymous reviewers for comments that significantly improved the quality of presentation of this paper. ...
doi:10.1109/jsac.2008.080906
fatcat:3uuwdcozjjcuxg354ycqwuznhi
Cooperative game theory and the Gaussian interference channel
[article]
2007
arXiv
pre-print
Preserved Fulltext
The Internet Archive has a preservation copy of this work in our general collections.
The file type is application/pdf.
In this paper we discuss the use of cooperative game theory for analyzing interference channels. ...
We extend our previous work, to games with N players as well as frequency selective channels and joint TDM/FDM strategies. ...
The adaptation of game theory approach for rate allocation in existing wireless and wireline system is very appealing. ...
arXiv:0708.0846v1
fatcat:xxby5z5e6zczpfxk5muvdg6ybq
Globally Optimal Channel Assignment for Non-Cooperative Wireless Networks
2008
IEEE INFOCOM 2008 - The 27th Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
that of anarchy and Nash Equilibrium (NE). ...
Existing work on this problem has considered Nash Equilibrium (NE), which is not a very strong solution concept and may not guarantee a good system-wide performance. ...
The most commonly used solution concept in game theory is Nash Equilibrium (NE) [27] : Definition 1 (Nash Equilibrium): A Nash Equilibrium of a strategic game is a profile s * ∈ Σ of strategies with the ...
doi:10.1109/infocom.2008.214
dblp:conf/infocom/WuZQ08
fatcat:btna3qe7kvexxlvnacdial6rr4
Globally Optimal Channel Assignment for Non-Cooperative Wireless Networks
2008
2008 Proceedings IEEE INFOCOM - The 27th Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
that of anarchy and Nash Equilibrium (NE). ...
Existing work on this problem has considered Nash Equilibrium (NE), which is not a very strong solution concept and may not guarantee a good system-wide performance. ...
The most commonly used solution concept in game theory is Nash Equilibrium (NE) [27] : Definition 1 (Nash Equilibrium): A Nash Equilibrium of a strategic game is a profile s * ∈ Σ of strategies with the ...
doi:10.1109/infocom.2007.214
fatcat:kqldouhqpjftjbzvrxz7njcdaq
The Case for Non-Cooperative Multihoming of Users to Access Points in IEEE 802.11 WLANs
2006
Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2006; you can also visit the original URL.
The file type is application/pdf.
User throughput in each AP is determined by the number of other users as well as the frame size and physical rate being used. ...
., split their traffic amongst all the available APs, based on the throughput they obtain and the price charged. Thus, they are involved in a non-cooperative game with each other. ...
The authors would like to thank the International Programs in Engineering (IPENG) at the University of Illinois at Urbana-Champaign and the Indo-French Center for Promotion of Advanced Research (IFCPAR ...
doi:10.1109/infocom.2006.314
dblp:conf/infocom/ShakkottaiAK06
fatcat:3cc7yumeejagzoghhqm74xikha
A game theoretic approach for the association problem in two-tier HetNets
2013
Proceedings of the 2013 25th International Teletraffic Congress (ITC)
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The proposed hierarchical decision approach for wireless networks can reach a good trade-off between the global network performance at the equilibrium and the requested amount of signaling. ...
In particular, we investigate the properties of a hierarchical game, in which the macro-cell BS is a player on its own. ...
Price of Anarchy In Figure 4 , we observe as expected that the price of anarchy is non-increasing function of the number of users. ...
doi:10.1109/itc.2013.6662962
dblp:conf/teletraffic/HaddadWAS13
fatcat:6vcht5biobcslgmmvoxgq7t4ja
Network Games: Theory, Models, and Dynamics
2011
Synthesis Lectures on Communication Networks
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
., UMTS cellular system or a wireless LAN network). ...
As in the previous sections, we are interested in the worst-case
CONGESTION AND PROVIDER PRICE COMPETITION 93 performance (or Price of Anarchy) of an oligopoly equilibrium, so we look for a lower bound ...
Recall that the price of anarchy (PoA) is (an upper bound on) the performance ratio (in terms of a relevant social performance measure) between the global optimum and the worst Nash equilibrium, while ...
doi:10.2200/s00330ed1v01y201101cnt009
fatcat:ij7x6c5kpnarxf7vyyxmcmt5x4
Game theory and the flat-fading gaussian interference channel
2009
IEEE Signal Processing Magazine
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf.
PRICE OF ANARCHY One characterization of the efficiency of the Nash equilibrium is the so-called price of anarchy (PoA) [19] , [20] . ...
Considering first only the
THE PRICE OF ANARCHY MEASURES THE COST THAT A SYSTEM PAYS FOR OPERATING WITHOUT COOPERATION. parameters P 1 , P 2 , the Nash equilibrium is the set of P 1 , P 2 for which R ...
doi:10.1109/msp.2009.933370
fatcat:3nxgpb7xsndpvhezlf6k3efsde
Network Selection and Resource Allocation Games for Wireless Access Networks
2013
IEEE Transactions on Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
The existence of exact and approximated subgame perfect Nash equilibria of the two-stage game is thoroughly assessed and numerical results are provided on the "quality" of such equilibria. ...
System level simulations are then used to evaluate the actual throughput and fairness of the equilibrium points. ...
quality in terms of Price of Anarchy and Price of Stability. ...
doi:10.1109/tmc.2012.207
fatcat:6ntn6sb27rgjlmhehth6l7amam
Non-cooperative resource competition game by virtual referee in multi-cell OFDMA networks
2007
IEEE Journal on Selected Areas in Communications
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2010; you can also visit the original URL.
The file type is application/pdf.
The pure non-cooperative game may result in non-convergence or some undesirable Nash Equilibriums with low system and individual performances. ...
In this paper, a distributive non-cooperative game is proposed to perform sub-channel assignment, adaptive modulation, and power control for multi-cell multi-user Orthogonal Frequency Division Multiplexing ...
Pricing Anarchy is discussed in 0733-8716/07/$25.00 c 2007 IEEE details in [10] for routing problem. ...
doi:10.1109/jsac.2007.070803
fatcat:zduetz2nsjhvxftggnd3r3nh7e
Peer-to-peer overlay topology control for mobile ad hoc networks
2011
Pervasive and Mobile Computing
Preserved Fulltext
A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf.
In this paper, we study the construction of P2P overlays by selfish peers in the context of MANETs, and propose a computationally feasible game-theoretic heuristic algorithm. ...
We find that Nash equilibria are difficult to find at best, and may not even exist in most cases. ...
Their comments significantly helped us to improve the quality of this paper. This work is supported by a grant from the Natural Sciences and Engineering Research Council of Canada (NSERC). ...
doi:10.1016/j.pmcj.2011.04.003
fatcat:ez2jqagaubfbnbsnupvmsvpjxy
« Previous
Showing results 1 — 15 out of 30 results