Filters








149 Hits in 8.0 sec

Stackelberg Shortest Path Tree Game, Revisited [article]

Sergio Cabello
2012 arXiv   pre-print
Computational aspects of a 2-Player Stackelberg shortest paths tree game. Proc. WINE 2008].  ...  Using our data structure, we save almost a linear factor when computing the optimal strategy in the Stackelberg shortest paths tree game of [D. Bilò and L. Gualà and G. Proietti and P. Widmayer.  ...  3 2 1 3 1 2 1 Figure 1 : An example of a Stackelberg shortest path tree game.  ... 
arXiv:1207.2317v1 fatcat:u6nfxkvhprevlhkf4yerm53sku

Network spot-checking games: Theory and application to toll enforcing in transportation networks

Ralf Borndörfer, Julia Buwaya, Guillaume Sagnol, Elmar Swarat
2015 Networks  
More generally, we prove that it is NP-hard to compute a strong Stackelberg equilibrium in a polymatrix game, even if the game is pairwise zero-sum.  ...  In an SC game, the pure strategies of network users correspond to paths in a graph, and the pure strategies of the inspectors are subset of arcs to be controlled.  ...  We also wish to thank four anonymous reviewers of the SAGT'14 conference -where the theoretical part of this article has been presented as a brief announcement [16] -for their feedback.  ... 
doi:10.1002/net.21596 fatcat:6vgt4lqfznffvdiovtmcpamjca

Hardness of an Asymmetric 2-player Stackelberg Network Pricing Game [article]

Davide Bilò, Luciano Gualà, Guido Proietti
2009 Electronic colloquium on computational complexity  
In this paper, we study the natural setting in which the follower computes a single-source shortest paths tree of G, and then returns to the leader a payment equal to the sum of the selected priceable  ...  Thus, the problem can be modeled as a one-round two-player Stackelberg Network Pricing Game (SNPG), with the additional complication that the objective functions of the two players are asymmetric.  ...  Such a game, that we name Asymmetric Stackelberg Shortest Paths Tree (ASSPT) game, finds its motivation in the popularity of the multicast protocol in the Internet: here, the follower needs to perform  ... 
dblp:journals/eccc/BiloGP09 fatcat:iwgn2kiwnndodjyerfi4xr66hy

On the Mediation Price War of 5G Providers

Laszlo Toka, Akos Recse, Mate Cserep, Robert Szabo
2020 Electronics  
In this work, we model the business relations of infrastructure providers as a variation of network formation games.  ...  deploying applications within for a maximal geographic reach of clients.  ...  Conflicts of Interest: The authors declare no conflict of interest.  ... 
doi:10.3390/electronics9111901 fatcat:iemvmqang5brlfmxfwg2v7x2ki

Double-oracle sampling method for Stackelberg Equilibrium approximation in general-sum extensive-form games [article]

Jan Karwowski, Jacek Mańdziuk
2019 arXiv   pre-print
The method is based on iterative interleaving of the two following phases: (1) guided Monte Carlo Tree Search sampling of the Follower's strategy space and (2) building the Leader's behavior strategy tree  ...  The paper presents a new method for approximating Strong Stackelberg Equilibrium in general-sum sequential games with imperfect information and perfect recall.  ...  An example transformation of two-player EF game to one-player AFG is presented in Fig. 2 .  ... 
arXiv:1909.03934v1 fatcat:qeobbecinvffteziqbecv2wppm

A game theoretic analysis of network design with socially-aware users

Jocelyne Elias, Fabio Martignon, Konstantin Avrachenkov, Giovanni Neglia
2011 Computer Networks  
In the first game we incorporate a socially-aware component in the users' utility functions, while in the second game we use additionally a Stackelberg (leader-follower) approach, where a leader (e.g.,  ...  Each user's goal is to connect a given set of terminals with the minimum possible cost. Game theory is the natural framework to address the interaction of such self-interested users (or players).  ...  Acknowledgments This work was partially supported by MIUR in the framework of the PRIN SESAME project.  ... 
doi:10.1016/j.comnet.2010.07.014 fatcat:dkigcxe7ozhmzd3g2wfvynv4du

Hardness of an Asymmetric 2-Player Stackelberg Network Pricing Game

Davide Bilò, Luciano Gualà, Guido Proietti
2020 Algorithms  
In this paper, we study the natural setting in which the follower computes a single-source shortest paths tree of G, and then returns to the leader a payment equal to the sum of the selected priceable  ...  Thus, the problem can be modeled as a one-round two-player Stackelberg Network Pricing Game, but with the novelty that the objective functions of the two players are asymmetric, in that the revenue returned  ...  More formally, our game, which we call Asymmetric Stackelberg Shortest Paths Tree (ASSPT), can be described as the following bilevel optimization problem (all the paths are assumed to be directed): • Instance  ... 
doi:10.3390/a14010008 fatcat:4qkjdg4vczg3xmnbcusmoytxzm

Double-Oracle Sampling Method for Stackelberg Equilibrium Approximation in General-Sum Extensive-Form Games

Jan Karwowski, Jecek Mańdziuk
2020 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
The method is based on iterative interleaving of the two following phases: (1) guided Monte Carlo Tree Search sampling of the Follower's strategy space and (2) building the Leader's behavior strategy tree  ...  The paper presents a new method for approximating Strong Stackelberg Equilibrium in general-sum sequential games with imperfect information and perfect recall.  ...  An example transformation of two-player EF game to one-player AFG is presented in Fig. 2 .  ... 
doi:10.1609/aaai.v34i02.5578 fatcat:r4agvkgrgnhwdprs2v4gcwzdei

An Adversarial Dynamic Game to Controlling Information Diffusion under Typical Strategies on Online Social Networks

Yifan Liu, Ruinan Zeng, Lili Chen, Zhen Wang, Liqin Hu
2022 Frontiers in Physics  
Based on the existing two-player Stackelberg zero-sum game model and evaluation methods of node's importance on the network, we analyze the typical strategic dynamic game in which the blocker moves first  ...  Therefore, how to control the information diffusion of the malicious spreader is a great challenge.  ...  ONLINE INFORMATION DIFFUSE DYNAMIC GAME MODEL We formulate the controlling diffusion problem as a Stackelberg zero-sum game, in which the players are one blocker and one spreader.  ... 
doi:10.3389/fphy.2022.934741 fatcat:aot54vkw4rbtvcqakopntswioy

A Theoretical Examination of Practical Game Playing: Lookahead Search [chapter]

Vahab Mirrokni, Nithum Thain, Adrian Vetta
2012 Lecture Notes in Computer Science  
Lookahead search is perhaps the most natural and widely used game * Google Research, Google.  ...  Stackelberg leader-follower behaviours can be induced when the players have asymmetric computational power. For example, Stackelberg equilibria can be produced in the Cournot game.  ...  With unbounded computational power, the search tree becomes the complete (remaining) game tree used by Zermelo's algorithm. In practice the actual shape of the search tree T is chosen dynamically.  ... 
doi:10.1007/978-3-642-33996-7_22 fatcat:z2geyw4aszcmpa5bwynfepr5cq

Network Investment Game with Wardrop Followers [article]

Daniel Schmand, Marc Schröder, Alexander Skopalik
2019 arXiv   pre-print
We study a two-sided network investment game consisting of two sets of players, called providers and users. The game is set in two stages.  ...  In the first stage, providers aim to maximize their profit by investing in bandwidth of cloud computing services. The investments of the providers yield a set of usable services for the users.  ...  Computational aspects of a 2-player stackelberg shortest paths tree game. In International Workshop on Internet and Network Economics, pages 251-262. Springer, 2008.  ... 
arXiv:1904.10417v1 fatcat:teunzsonlfbrrfysyzdreicqge

On the Implications of Lookahead Search in Game Playing [article]

Vahab Mirrokni, Nithum Thain, Adrian Vetta
2012 arXiv   pre-print
To determine a strategy play using lookahead search, each agent predicts multiple levels of possible re-actions to her move (via the use of a search tree), and then chooses the play that optimizes her  ...  Furthermore, the type of search tree chosen by computationally-constrained agent can vary. We focus on the case where agents can evaluate only a bounded number, k, of moves into the future.  ...  At its computation extreme, this latter approach in a finite game is Zermelo's algorithm -assign values to the leaf nodes 1 of the game tree and apply backwards induction to find the value of the current  ... 
arXiv:1202.4134v1 fatcat:drfg2mb4wzfqhc5gi365cfooam

Pricing games of NFV infrastructure providers

Laszlo Toka, Marton Zubor, Attila Korosi, George Darzanos, Ori Rottenstreich, Balazs Sonkoly
2020 Telecommunications Systems  
Business aspects around the provisioning of these services however pose still unresolved questions.  ...  We model this resource market with the tool set of graph and game theory in order to study its characteristics.  ...  To view a copy of this licence, visit http://creativecomm ons.org/licenses/by/4.0/.  ... 
doi:10.1007/s11235-020-00706-5 fatcat:fozsmjcdjzaypet4xax445iike

Computing Optimal Security Strategies for Interdependent Assets [article]

Joshua Letchford, Yevgeniy Vorobeychik
2012 arXiv   pre-print
First, we extend previous linear programming techniques for Stackelberg security games to incorporate benefits and costs of arbitrary security configurations on individual assets.  ...  We introduce a novel framework for computing optimal randomized security policies in networked domains which extends previous approaches in several ways.  ...  , whose goal typically involves some variant of a network flow problem (e.g., maximizing flow or computing a shortest path).  ... 
arXiv:1210.4873v1 fatcat:akdv22vsmbejzmwjyrecng7kmy

Fast Algorithms for Game-Theoretic Centrality Measures [article]

Piotr Lech Szczepański
2015 arXiv   pre-print
Next, the centrality of any individual node is determined by a chosen game-theoretic solution concept (notably, the Shapley value) in the same way as the payoff of a player in a cooperative game.  ...  Finally, we analyse computational properties of generalized version of cooperative games in which order of player matters.  ...  The instance of Stackelberg games closely related to this problem is called Shortest Path Interdiction.  ... 
arXiv:1512.01764v1 fatcat:tpodgmxjbrampdarikpvhpglx4
« Previous Showing results 1 — 15 out of 149 results