Filters








5,171 Hits in 5.7 sec

Convergence of Best-Response Dynamics in Games with Conflicting Congestion Effects [chapter]

Michal Feldman, Tami Tamir
2012 Lecture Notes in Computer Science  
We show that, in contrast to standard congestion games with identical jobs and resources, the convergence rate of BRD under conflicting congestion effects might be super-linear in the number of jobs.  ...  We study the model of resource allocation games with conflicting congestion effects that was introduced by Feldman and Tamir [9] .  ...  In this paper, we study the convergence rate of BRD in a job scheduling game with conflicting congestion effects and identical agents.  ... 
doi:10.1007/978-3-642-35311-6_38 fatcat:jmxcx64kcbcrbfdixxiioxmaua

Convergence of best-response dynamics in games with conflicting congestion effects

Michal Feldman, Tami Tamir
2015 Information Processing Letters  
We show that, in contrast to standard congestion games with identical jobs and resources, the convergence rate of BRD under conflicting congestion effects might be super-linear in the number of jobs.  ...  We study the model of resource allocation games with conflicting congestion effects that was introduced by Feldman and Tamir [9] .  ...  In this paper, we study the convergence rate of BRD in a job scheduling game with conflicting congestion effects and identical agents.  ... 
doi:10.1016/j.ipl.2014.07.012 fatcat:sujzhzziirgbnglglx76p4mtzu

A better-response strategy for self-interested planning agents

Jaume Jordán, Alejandro Torreño, Mathijs de Weerdt, Eva Onaindia
2017 Applied intelligence (Boston)  
In this work, we define a general-sum game in which interactions such as conflicts and congestions are reflected in the agents' utility.  ...  We propose a better-response planning strategy that guarantees convergence to an equilibrium joint plan by imposing a tax to agents involved in conflicts.  ...  , and delays of solvable conflicts and/or congestions), the IPG with betterresponse dynamics will converge to a PNE in most cases.  ... 
doi:10.1007/s10489-017-1046-5 fatcat:ext2ft2xajc3lgamohnofb2dda

Convergence Dynamics of Graphical Congestion Games [chapter]

Richard Southwell, Yanjiao Chen, Jianwei Huang, Qian Zhang
2012 Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering  
In this paper, we study the convergence dynamics of graphical congestion games where players can use multiple resources simultaneously.  ...  We show that when the players are free to use any subset of resources the game always converges to a pure Nash equilibrium in polynomial time via lazy best response updates.  ...  A cycle in the best response dynamics of the powerset graphical congestion game discussed in the proof of Theorem 1.  ... 
doi:10.1007/978-3-642-35582-0_3 fatcat:nfoxs3ojvnbopizlyemodvdbhm

The Efficiency of Best-Response Dynamics [article]

Michal Feldman and Yuval Snappir and Tami Tamir
2020 arXiv   pre-print
We study the inefficiency of various deviator rules in network formation games and job scheduling games (both are congestion games, where BR dynamics always converges to a pure NE).  ...  Best response (BR) dynamics is a natural method by which players proceed toward a pure Nash equilibrium via a local search method.  ...  B= Inefficient deviator rule in a job scheduling game with conflicting congestion effectsTheorem B.1The inefficiency of a deviator rule in a job scheduling game with conflicting congestions effects can  ... 
arXiv:2002.11461v1 fatcat:jp55zmdmcvbdhnbyjeu7tvwaae

A game theoretic power control and spectrum sharing approach using cost dominance in cognitive radio networks

Sundus Naseer, Qurratul-Ain Minhas, Khalid Saleem, Ghazanfar Farooq Siddiqui, Naeem Bhatti, Hasan Mahmood
2021 PeerJ Computer Science  
The Nash equilibrium (NE) of a cooperative congestion game is examined by considering the cost basis, which is embedded in the utility function.  ...  The wireless networks face challenges in efficient utilization of bandwidth due to paucity of resources and lack of central management, which may result in undesired congestion.  ...  assists in mitigating the effects of conflicts in spectrum sharing.  ... 
doi:10.7717/peerj-cs.617 fatcat:353p44l4l5es5ldcftp7y7ia6e

Approximate Best-Response Dynamics in Random Interference Games

Ilai Bistritz, Amir Leshem
2018 IEEE Transactions on Automatic Control  
In this paper we develop a novel approach to the convergence of Best-Response Dynamics for the family of interference games.  ...  Our goal is to prove convergence of the approximate best-response dynamics with high probability with respect to the randomized game.  ...  CONCLUSION In this work we proved the convergence of asynchronous approximate best-response dynamics in a class of games called interference games, which model a natural conflict in many wireless network  ... 
doi:10.1109/tac.2017.2749139 fatcat:tgduehp4obgljekqle3k3rwwna

An Abstract Framework for Non-Cooperative Multi-Agent Planning

Jaume Jordán, Javier Bajo, Vicent Botti, Vicente Julian
2019 Applied Sciences  
A case study is also carried out to show an illustrative example of how to solve a non-cooperative multi-agent planning problem with the presented framework.  ...  This work aims to establish a base on which to implement all the necessary phases using the appropriate technologies in each of them and to solve complex problems in different domains of application for  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/app9235180 fatcat:slccnoce5fdjflpipgj4cohw4q

Scanning the Issue

2018 IEEE Transactions on Automatic Control  
The authors generate an interference game at random and analyze the probability that it has converging approximate best-response dynamics, asymptotically in the number of players.  ...  Interference games model a fundamental conflict in wireless networks. They generalize congestion games, since each player has a unique influence on the other player.  ...  Scanning the Issue * Approximate Best-Response Dynamics in Random Interference Games Ilai Bistritz and Amir Leshem Interference games model a fundamental conflict in wireless networks.  ... 
doi:10.1109/tac.2018.2826728 fatcat:vheehtx7rre75oancfobi3y7qm

Independent Lazy Better-Response Dynamics on Network Games [article]

Paolo Penna
2019 arXiv   pre-print
We study an independent best-response dynamics on network games in which the nodes (players) decide to revise their strategies independently with some probability.  ...  We provide several bounds on the convergence time to an equilibrium as a function of this probability, the degree of the network, and the potential of the underlying games.  ...  Part of this work has been done while the first author was at LIAFA, Université Paris Diderot, supported by the French ANR Project DISPLEXITY.  ... 
arXiv:1609.08953v2 fatcat:5gvnflyepbfirdpjvgls2egcoi

Conflicting Congestion Effects in Resource Allocation Games [chapter]

Michal Feldman, Tami Tamir
2008 Lecture Notes in Computer Science  
We also observe that, unlike in congestion games, best-response dynamics (BRD) are not guaranteed to converge to a Nash equilibrium.  ...  Our framework departs from the existing game-theoretic models mainly in assuming conflicting congestion effects, but also in assuming an unlimited supply of resources.  ...  Convergence of Best-Response Dynamics Best-response dynamics (BRD) is a local search method where in each step some player is chosen and plays its best-response strategy, given the strategies of the others  ... 
doi:10.1007/978-3-540-92185-1_19 fatcat:xtvmkumapnhcncy4lydl7cakki

Conflicting Congestion Effects in Resource Allocation Games

Michal Feldman, Tami Tamir
2012 Operations Research  
Finally, we observe that unlike congestion games, best-response dynamics are not guaranteed to converge to a Nash equilibrium.  ...  First, while most of the previous work has considered cost structures with either negative congestion effects or positive ones, we introduce cost functions that encompass both effects.  ...  In contrast to the last example, if all jobs have the same length, then the induced game is a congestion game [20] (with m = n), and thus best response dynamics always converge to a NE.  ... 
doi:10.1287/opre.1120.1051 fatcat:zl2krqpc35dqpfbe3ponahu32m

Reconciling the Overlay and Underlay Tussle

Jin Xiao, Raouf Boutaba
2014 IEEE/ACM Transactions on Networking  
Furthermore, we analyze the interaction of overlays and underlays as a two-stage congestion game and recommend simple operational guidelines to ensure global stability.  ...  and the overall convergence is polynomial in the unweighed case.  ...  Hence, under the best-response dynamics, the big moves are always made first. Lemma 3.2.3: The trailing moves of congestion game must all be small moves under best-response.  ... 
doi:10.1109/tnet.2013.2281276 fatcat:zi4t24oh7feklpmso22wcnup5y

Competitive equilibrium and stable coalition in overlay environments

Shan Jiang, Jianxin Liao, Jun Gong, Jingyu Wang, Tonghong Li
2015 2015 IEEE 40th Conference on Local Computer Networks (LCN)  
In this paper, we adopt game theoretic approaches to analyze this hybrid interaction.  ...  Firstly, we model a situation of the hybrid interaction as an n+1player non-cooperative game, where overlays and TE are of equal status, and prove the existence of Nash equilibrium (NE).  ...  Dynamic Best Response In general, players do not possess perfect information of other players at the beginning of the game, and they can only play their strategies based on the existent situation.  ... 
doi:10.1109/lcn.2015.7366331 dblp:conf/lcn/JiangLGWL15 fatcat:g5vtmmqmq5gt3pg5lfh6m3wmlu

Distributed spectrum management in TV White Space Cognitive Radio Networks

Jocelyne Elias, Marwan Krunz
2015 2015 IFIP Networking Conference (IFIP Networking)  
Accordingly, we use a Best Response algorithm to converge in few iterations to the Nash Equilibrium (NE) points.  ...  We evaluate the performance of the proposed game, considering both static and dynamic TVWS scenarios and taking into account users' mobility.  ...  Any opinions, findings, conclusions, or recommendations expressed in this paper are those of the author(s) and do not necessarily reflect the views of the NSF or ARO.  ... 
doi:10.1109/ifipnetworking.2015.7145338 dblp:conf/networking/EliasK15 fatcat:qxtpyyeoijgermxcqse5uxl47y
« Previous Showing results 1 — 15 out of 5,171 results