Results 91 to 100 of about 2,305 (251)
Congestion Games and Coordination Mechanisms
, 2004 In recent years we witness a fusion of ideas coming from the fields of Game Theory, Networks, and Algorithms. One of the central ideas in this new area is the notion of the price of anarchy [5,7] which is an attempt to measure the deterioration in performance of a system due to selfish behavior of its users or components.
openaire +4 more sources
Building Blocks as Experiences in Dynamic Capacitated Arc Routing Problems
CAAI Transactions on Intelligence Technology, EarlyView.ABSTRACT The dynamic capacitated arc routing problem (DCARP) aims to update the service paths of vehicles in the capacitated arc routing problem when uncertain factors deteriorate the current schedule of vehicles' services. A DCARP scenario comprises a series of DCARP instances that share similarities with each other. Therefore, optimisation experience
Hao Tong +4 more
wiley +1 more source
Atomic congestion games among coalitions
ACM Transactions on Algorithms, 2006 We consider algorithmic questions concerning the existence, tractability, and quality of Nash equilibria, in atomic congestion games among users participating in selfish coalitions. We introduce a coalitional congestion model among atomic players and demonstrate many interesting similarities with the noncooperative case.
Dimitris Fotakis 0001 +2 more
openaire +2 more sources
High Voltage, EarlyView.ABSTRACT This paper provides an overview of high‐temperature superconducting (HTS) cables in DC systems, with a focus on their deployment in high‐voltage DC (HVDC) networks. The assessment of HTS cable properties—such as extremely low electrical resistance, high current‐carrying capacity and a compact geometry—and their comparison with those of ...
Mohammad Hossein Mousavi +2 more
wiley +1 more source
Generalized mirror descents in congestion games
Artificial Intelligence, 2016 In Artificial Intelligence, Volume 241, Dec ...
Po-An Chen, Chi-Jen Lu
openaire +4 more sources
IET Smart Energy Systems, EarlyView.A PER‐MATD3‐based bidding model for generators in day‐ahead joint energy and reserve markets is proposed. An aggressiveness coefficient quantifies risk preference, KAN improves interpretability and simulation results demonstrate enhanced coordinated decision‐making and training stability.
Xinge Xu +5 more
wiley +1 more source
MathematicsWireless Sensor Networks (WSNs) consist of numerous battery-powered sensor nodes that operate with limited energy, computation, and communication capabilities.
Seyed Salar Sefati +4 more
doaj +1 more source
IET Smart Energy Systems, EarlyView.To effectively harness the flexibility of urban residential buildings, this study proposes using the feasible flexibility region (FFR) of residential smart buildings (RSB) as an alternative to directly scheduling a large number of diverse, dispersed, and heterogeneous flexibility resources.
Youjun Deng +3 more
wiley +1 more source
Malicious Bayesian Congestion Games [PDF]
, 2009 In this paper, we introduce malicious Bayesian congestion games as an extension to congestion games where players might act in a malicious way. In such a game each player has two types. Either the player is a rational player seeking to minimize her own delay, or - with a certain probability - the player is malicious in which case her only goal is to ...
openaire +4 more sources
How Place‐Based Policy Could Counter Populist Discontent
The Political Quarterly, EarlyView.Abstract Resentment felt by people in areas that have suffered from social and economic decline is a significant driver of populist backlash—‘the revenge of the places that don't matter’. An effective place‐based strategy could provide something of an antidote to populist discontent.
Gerry Stoker +3 more
wiley +1 more source