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
Weakly-Acyclic (Internet) Routing Games
[chapter]
2011
Lecture Notes in Computer Science
Preserved Fulltext
(Interdomain Routing and Games, pp. 57-66, 2008), which models important aspects of routing on the Internet. ...
We show that, in interesting contexts, such routing games are weakly acyclic and, moreover, that pure Nash equilibria in such games can be found in a computationally efficient manner. ...
Recently, [1] presented a classification of weakly acyclic games. Internet Routing Games Fabrikant and Papadimitriou [5] and, independently, Levin et al. ...
doi:10.1007/978-3-642-24829-0_26
fatcat:baiywkwzrjgpbmp6wqtgvd7btm
Weakly-Acyclic (Internet) Routing Games
2013
Theory of Computing Systems
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.
(Interdomain Routing and Games, pp. 57-66, 2008), which models important aspects of routing on the Internet. ...
We show that, in interesting contexts, such routing games are weakly acyclic and, moreover, that pure Nash equilibria in such games can be found in a computationally efficient manner. ...
Recently, [1] presented a classification of weakly acyclic games. Internet Routing Games Fabrikant and Papadimitriou [5] and, independently, Levin et al. ...
doi:10.1007/s00224-013-9474-z
fatcat:5iaqejozp5hhdcnxtp37o6rm3e
A Classification of Weakly Acyclic Games
[article]
2014
arXiv
pre-print
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 2020; you can also visit the original URL.
The file type is application/pdf.
Other Versions
Weakly acyclic games form a natural generalization of the class of games that have the finite improvement property (FIP). ...
Finally, we explain how the schedulers allow us to improve the bounds on finding a Nash equilibrium in a weakly acyclic game. ...
In particular, [5] introduced a natural class of weakly acyclic games, which model the routing aspects on the Internet. ...
arXiv:1206.0130v5
fatcat:m2ystrxsnzcyviytxo26mr43ci
A Classification of Weakly Acyclic Games
[chapter]
2012
Lecture Notes in Computer Science
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 2019; you can also visit the original URL.
The file type is application/pdf.
Weakly acyclic games form a natural generalization of the class of games that have the finite improvement property (FIP). ...
We also show that finite games that can be solved by the iterated elimination of never best response strategies are weakly acyclic. ...
In particular, [5] introduced a natural class of weakly acyclic games, which model the routing aspects on the Internet. ...
doi:10.1007/978-3-642-33996-7_1
fatcat:sqbi6aw33jdgnlb4uir4cu4ovu
Cost-Balancing Tolls for Atomic Network Congestion Games
2008
Internet Mathematics
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.
Our main result is that for congestion games on series-parallel networks with strictly increasing latency functions, the optimal solution is induced as the unique pure Nash equilibrium of the game with ...
Hence any given configuration is induced as a pure Nash equilibrium of the modified game with the corresponding cost-balancing tolls. ...
An extended abstract of this work appeared in Internet and Network Economics: Third International Workshop, WINE 2007, San Diego, CA, USA, December 12-14, 2007, Proceedings, Lecture Notes in Computer Science ...
doi:10.1080/15427951.2008.10129175
fatcat:qhvay7qi45hcbasgf3bzoksczm
IEEE Access Special Section Editorial: Convergence of Sensor Networks, Cloud Computing, and Big Data in Industrial Internet of Things
2020
IEEE Access
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 2020; you can also visit the original URL.
The file type is application/pdf.
Only those weakly correlated features are added to the feature subset. ...
By adopting the game theory, a new two-stage game model, which consists of a judicious mixture of selection and incentive algorithms, was developed. ...
He has published over 400 papers in related conferences, journals, and books in the areas of sensor networks and the Internet of Things. ...
doi:10.1109/access.2020.3037614
fatcat:h27mydy5anggroyhsf5wipre6m
2021 Index IEEE Internet of Things Journal Vol. 8
2021
IEEE Internet of Things Journal
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 2022; you can also visit the original URL.
The file type is application/pdf.
., +, JIoT July 15, 2021 11561-11580 SURFER: A Secure SDN-Based Routing Protocol for Internet of Vehicles. ...
New Preventive Routing Method Based on Clustering and Location Prediction in the Mobile Internet of Things. ...
doi:10.1109/jiot.2022.3141840
fatcat:42a2qzt4jnbwxihxp6rzosha3y
Applications of Multi-Agent Reinforcement Learning in Future Internet: A Comprehensive Survey
[article]
2022
arXiv
pre-print
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 2022; you can also visit the original URL.
The file type is application/pdf.
Other Versions
The issues consist of network access, transmit power control, computation offloading, content caching, packet routing, trajectory design for UAV-aided networks, and network security issues. ...
Future Internet involves several emerging technologies such as 5G and beyond 5G networks, vehicular networks, unmanned aerial vehicle (UAV) networks, and Internet of Things (IoTs). ...
After receiving a reward, the CR uses the update rules of Q-learning and SARSA to update its Q-value with respect to stationarity policies of other CRs under weakly acyclicity to compute its best response ...
arXiv:2110.13484v2
fatcat:u2o5uxms65gmnp3q7xbh35l5oi
Jump-starting coordination in a stag hunt: Motivation, mechanisms, and their analysis
[article]
2016
arXiv
pre-print
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 2019; you can also visit the original URL.
The file type is application/pdf.
The stag hunt (or assurance game) is a simple game that has been used as a prototype of a variety of social coordination problems (ranging from the social contract to the adoption of technical standards ...
In this paper, we present and analyze using game-theoretic techniques mechanisms aiming to avert coordination failures and incite instead selection of the superior equilibrium. ...
I would, finally, like to thank an anonymous reviewer for simplifying my proof that stag hunts are weakly acyclic games. ...
arXiv:1601.03162v1
fatcat:vxnys2xxcjg33p5u7fp4osbnuq
On incremental deployability
[article]
2018
arXiv
pre-print
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 2020; you can also visit the original URL.
The file type is application/pdf.
To that end, we draw on an elementary concept in Internet systems engineering, namely, that of incremental deployability, which we study mathematically and computationally. ...
Motivated by the difficulty of effecting fundamental change in the architecture of the Internet, in this paper, we study from a theoretical perspective the question of how individuals can join forces toward ...
Stag hunts are weakly acyclic games. Proof. ...
arXiv:1805.10115v1
fatcat:2ovf2na3jnbz3dwmrtiphdp6oy
Trust Brokerage Systems for the Internet
[article]
2002
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.
Lattices Acyclic A lattice of preferences must be an acyclic structure. ...
There are some interesting games theory scenarios that suggest this may be so [BCP94] . ...
responses to a previous performative eos end of stream of responses to an earlier query error S considers R's earlier message to be malformed evaluate S wants R to simplify the sentence forward S wants R to route ...
arXiv:cs/0204041v1
fatcat:3cnrtz2fzrbkzpn4cgs3bs6p2a
A Survey of Security Challenges, Attacks Taxonomy and Advanced Countermeasures in the Internet of Things
2020
IEEE Access
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 2020; you can also visit the original URL.
The file type is application/pdf.
This method is based on interactions between a receiver and Spoofers as a zero-sum spoofing detection game. ...
An intruder floods out malicious routing information to claim the best route to the destination [57] , [62] . The sender then chooses the malicious route to transmit the packets. ...
doi:10.1109/access.2020.3037359
fatcat:pw4fsmelmjgc5anm7hp537l63e
Efficient Local Search in Coordination Games on Graphs
[article]
2016
arXiv
pre-print
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 2020; you can also visit the original URL.
The file type is application/pdf.
These games capture the idea of coordination in the absence of globally common strategies. ...
Prior work shows that the problem of determining the existence of a pure Nash equilibrium for these games is NP-complete already for graphs with all weights equal to one and no bonuses. ...
Engelberg and Schapira [7] showed that certain Internet routing games are weakly acyclic. ...
arXiv:1604.04809v1
fatcat:pmynmdkejjgjnfmqmd54wmfsnq
Coordination Games on Weighted Directed Graphs
[article]
2021
arXiv
pre-print
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 2020; you can also visit the original URL.
The file type is application/pdf.
Note that this fulltext copy is not of the "primary" version of this work. The version it corresponds to is:
2019 pre-print arXiv:1910.02693v1 fatcat:l6kzr6p46zgjtnhupz4zwvveiu
This implies that the same problems for polymatrix games are strongly NP-hard. ...
These games capture the idea of coordination in the absence of globally common strategies. ...
[18] and more fully [19] showed that specific Internet routing games are weakly acyclic. ...
arXiv:1910.02693v2
fatcat:rd4sitayp5amlfiobylvwn2vqm
Game couplings: Learning dynamics and applications
2011
IEEE Conference on Decision and Control and European Control Conference
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.
We establish sufficient and necessary conditions for the coupling of two potential games to result into a new potential game. Similar questions are explored for the case of weakly acyclic games. ...
Game coupling intuitively allows us to stitch together the payoff structures of two or more games into a new game. ...
A market-sharing game is an exact potential game and thus weakly acyclic. ...
doi:10.1109/cdc.2011.6161365
dblp:conf/cdc/BalcanCPS11
fatcat:xatrmvpnzfhm7oxx4rnxuodb7y
« Previous
Showing results 1 — 15 out of 204 results