How should agents shape a finite “reputational" history to their advantage knowing that others will be learning from that history? We focus on one leader interacting with multiple followers and show that in most non-zero-sum games, the traditional Stackelberg mixed commitment is very fragile to observational uncertainty. We propose robust commitment rules that anticipate being learned and show ...

This paper investigates the emission reduction performance for supply chain members in both single-channel and exclusive dual-channel cases. Two game scenarios (Manufacturer Stackelberg and Retailer Stackelberg) are examined under different channel structures. Furthermore, we introduce government subsidies as an impact factor of low-carbon strategy adoption. In the single-channel (Case 1), we m...

Let G(V,E) be a directed graph with n vertices and m edges. The edges E of G are divided into two types: EF and EP . Each edge of EF has a fixed price. The edges of EP are the priceable edges and their price is not fixed a priori. Let r be a vertex of G. For an assignment of prices to the edges of EP , the revenue is given by the following procedure: select a shortest path tree T from r with re...

This paper studies multi-user communication systems with two groups of users: leaders which possess system information, and followers which have no system information using the formulation of Stackelberg games. In such games, the leaders play and choose their actions based on their information about the system and the followers choose their actions myopically according to their observations of ...

This contribution deals with a two-level discrete decision problem, a so-called Stackelberg strategic game: A Subset Sum setting is addressed with a set $N$ of items with given integer weights. One distinguished player, the leader, may alter the weights of the items in a given subset $L\subset N$, and a second player, the follower, selects a solution $A\subseteq N$ in order to utilize a bounded...

Game-theoretic algorithms for physical security have made an impressive realworld impact. These algorithms compute an optimal strategy for the defender to commit to in a Stackelberg game, where the attacker observes the defender’s strategy and best-responds. In order to build the game model, though, the payoffs of potential attackers for various outcomes must be estimated; inaccurate estimates ...

We consider a dynamic game where additional players (assumed identical, even if there will be a mild departure from that hypothesis) join the game randomly according to a Bernoulli process. The problem solved here is that of computing their expected payoff as a function of time and the number of players present when they arrive, if the strategies are given. We consider both a finite horizon gam...

We study a non-cooperative game with aggregative structure, namely when the payoffs depend on the strategies of the opponent players through an aggregator function. We assume that a subset of players behave as leaders in a Stackelberg model. The leaders, as well the followers, act non-cooperatively between themselves and solve a Nash equilibrium problem. We assume an exogenous uncertainty affec...

While three deployed applications of game theory for security have recently been reported at AAMAS [12], we as a community remain in the early stages of these deployments; there is a continuing need to understand the core principles for innovative security applications of game theory. Towards that end, this paper presents PROTECT, a game-theoretic system deployed by the United States Coast Guar...