Results 51 to 60 of about 621,141 (286)
Internet virtual classes as a substitute for face-to-face learning are becoming common use in schools during the pandemic, which activities outside the home is restricted.
Linna Oktaviana Sari +3 more
doaj +1 more source
On Poisoned Wardrop Equilibrium in Congestion Games [PDF]
Recent years have witnessed a growing number of attack vectors against increasingly interconnected traffic networks. Informational attacks have emerged as the prominent ones that aim to poison traffic data, misguide users, and manipulate traffic patterns.
Yunian Pan, Quanyan Zhu
semanticscholar +1 more source
Altruism Improves Congestion in Series-Parallel Nonatomic Congestion Games [PDF]
Self-interested routing policies from individual users in a system can collectively lead to poor aggregate congestion in routing networks. The introduction of altruistic agents (referred to as altruists), whose goal is to minimize other agents’ routing ...
Colton Hill, Philip N. Brown
semanticscholar +1 more source
Cooperate or Compete: Coalition Formation in Congestion Games [PDF]
This paper investigates the potential benefits of cooperation in scenarios where finitely many agents compete for shared resources, leading to congestion and thereby reduced rewards.
Riya Sultana, V. Kavitha
semanticscholar +1 more source
Counter-Intuitive Effects of
Exploration is an integral part of learning dynamics which allows algorithms to search a space of solutions. When many algorithms simultaneously explore, this can lead to counter-intuitive effects. This paper contributes an analysis of the influence that
Cesare Carissimo
doaj +1 more source
Spectum sharing as congestion games [PDF]
A fundamental problem in wireless networking is efficient spectrum sharing. In this paper we study this problem in the context of decentralized multi-user frequency adaptation, with the objective of designing protocols that are efficient, agile, robust, and incentive-compatible.
Mingyan Liu, Yunnan Wu
openaire +1 more source
A Sensitivity Analysis of the Price of Anarchy in Nonatomic Congestion Games
The price of anarchy (PoA) is a standard measure to quantify the inefficiency of equilibria in nonatomic congestion games. Most publications have focused on worst-case bounds for the PoA.
Zijun Wu, Rolf Moehring
semanticscholar +1 more source
Congestion Control for Cloud Gaming Over UDP Based on Round-Trip Video Latency
We describe a network congestion control mechanism for cloud gaming (CG) platforms based on the user datagram protocol (UDP). To minimize the contribution of the downstream transmission delay to the total end-to-end latency in the interaction-perception ...
Alberto Alos +4 more
doaj +1 more source
The utilization of Digital Twin technology allows for the simulation of network behavior, anticipating traffic surges, and implementing efficient traffic routing strategies to prevent congestion.
Madhuri Husan Badole +1 more
doaj +1 more source
Totally Unimodular Congestion Games [PDF]
We investigate a new class of congestion games, called Totally Unimodular (TU) Congestion Games, where the players' strategies are binary vectors inside polyhedra defined by totally unimodular constraint matrices. Network congestion games belong to this class.
Alberto Del Pia +2 more
openaire +2 more sources

