Stackelberg Network Pricing Games

We study a multi-player one-round game termed Stackelberg Network Pricing Game, in which a leader can set prices for a subset of $m$ priceable edges in a graph. The other edges have a fixed cost. Based on the leader's decision one or more followers optimize a polynomial-time solvable combinatorial minimization problem and choose a minimum cost solution satisfying their requirements based on the fixed costs and the leader's prices. The leader receives as revenue the total amount of prices paid by the followers for priceable edges in their solutions, and the problem is to find revenue maximizing prices. Our model extends several known pricing problems, including single-minded and unit-demand pricing, as well as Stackelberg pricing for certain follower problems like shortest path or minimum spanning tree. Our first main result is a tight analysis of a single-price algorithm for the single follower game, which provides a $(1+\epsilon) \log m$-approximation for any $\epsilon >0$. This can be extended to provide a $(1+\epsilon)(\log k + \log m)$-approximation for the general problem and $k$ followers. The latter result is essentially best possible, as the problem is shown to be hard to approximate within \mathcal{O(\log^\epsilon k + \log^\epsilon m). If followers have demands, the single-price algorithm provides a $(1+\epsilon)m^2$-approximation, and the problem is hard to approximate within \mathcal{O(m^\epsilon) for some $\epsilon >0$. Our second main result is a polynomial time algorithm for revenue maximization in the special case of Stackelberg bipartite vertex cover, which is based on non-trivial max-flow and LP-duality techniques. Our results can be extended to provide constant-factor approximations for any constant number of followers

Non Cooperatives Stackelberg Networks

Noncooperative network-formation games in oligopolies analyze optimal connection structures that emerge when linking represent the appropriation of cost-reducing one-way externalities. These models reflect situations where one firm access to another firm’s (public or private) information and this last cannot refuse it. What would happen if decisions are sequential? A model of exogenous Stackelberg leadership is developed and first-mover advantages are observed and commented.non cooperative games, network formation strategies, Stackelberg equilibrium.

Playing Stackelberg Opinion Optimization with Randomized Algorithms for Combinatorial Strategies

From a perspective of designing or engineering for opinion formation games in social networks, the "opinion maximization (or minimization)" problem has been studied mainly for designing subset selecting algorithms. We furthermore define a two-player zero-sum Stackelberg game of competitive opinion optimization by letting the player under study as the first-mover minimize the sum of expressed opinions by doing so-called "internal opinion design", knowing that the other adversarial player as the follower is to maximize the same objective by also conducting her own internal opinion design. We propose for the min player to play the "follow-the-perturbed-leader" algorithm in such Stackelberg game, obtaining losses depending on the other adversarial player's play. Since our strategy of subset selection is combinatorial in nature, the probabilities in a distribution over all the strategies would be too many to be enumerated one by one. Thus, we design a randomized algorithm to produce a (randomized) pure strategy. We show that the strategy output by the randomized algorithm for the min player is essentially an approximate equilibrium strategy against the other adversarial player

Finding Optimal Strategies in a Multi-Period Multi-Leader-Follower Stackelberg Game Using an Evolutionary Algorithm

Stackelberg games are a classic example of bilevel optimization problems, which are often encountered in game theory and economics. These are complex problems with a hierarchical structure, where one optimization task is nested within the other. Despite a number of studies on handling bilevel optimization problems, these problems still remain a challenging territory, and existing methodologies are able to handle only simple problems with few variables under assumptions of continuity and differentiability. In this paper, we consider a special case of a multi-period multi-leader-follower Stackelberg competition model with non-linear cost and demand functions and discrete production variables. The model has potential applications, for instance in aircraft manufacturing industry, which is an oligopoly where a few giant firms enjoy a tremendous commitment power over the other smaller players. We solve cases with different number of leaders and followers, and show how the entrance or exit of a player affects the profits of the other players. In the presence of various model complexities, we use a computationally intensive nested evolutionary strategy to find an optimal solution for the model. The strategy is evaluated on a test-suite of bilevel problems, and it has been shown that the method is successful in handling difficult bilevel problems.Comment: To be published in Computers and Operations Researc

Game Theoretic Approaches to Massive Data Processing in Wireless Networks

Wireless communication networks are becoming highly virtualized with two-layer hierarchies, in which controllers at the upper layer with tasks to achieve can ask a large number of agents at the lower layer to help realize computation, storage, and transmission functions. Through offloading data processing to the agents, the controllers can accomplish otherwise prohibitive big data processing. Incentive mechanisms are needed for the agents to perform the controllers' tasks in order to satisfy the corresponding objectives of controllers and agents. In this article, a hierarchical game framework with fast convergence and scalability is proposed to meet the demand for real-time processing for such situations. Possible future research directions in this emerging area are also discussed

Taxes versus quotas : the case of cocoa exports

The authors are particularly interested in evaluating the concern that efficiency or policy-induced changes in the supply of exports of primary commodities, such as cocoa, coffee, and tea, may lead to such a large decline in the prices of those commodities that export revenues and incomes of the exporting countries actually decline. This paper focuses on the implications of quantitative restrictions. It compares the implications of optimal Nash quotas and taxes when two or more countries compete against each other in the world market and finds that the outcome under taxes is less restrictive than under quotas but that the countries'profits are higher under quotas than under taxes. In simulations undertaken for the world cocoa market, it finds that for most countries optimal Nash taxes yield lower profits than the initial taxes or quotas. It also finds that even if countries choose taxes or quotas optimally, growth in a country can lead to a decline in the combined real income of the exporting countries. The simulations also cast doubt on the hypothesis that a market with five or more players can be regarded as roughly perfectly competitive.Environmental Economics&Policies,Economic Theory&Research,Public Sector Economics&Finance,TF054105-DONOR FUNDED OPERATION ADMINISTRATION FEE INCOME AND EXPENSE ACCOUNT,Access to Markets

Strategic trade policy and non-linear subsidy : in the case of price competition

In a strategic trade policy, it is assumed, in this paper, that a government changes disbursement or levy method so that the reaction function of home firm approaches infinitely close to that of foreign firm. In the framework of Bertrand-Nash equilibrium, Eaton and Grossman[1986] showed that export tax is preferable to export subsidy. In this paper, it is shown that export subsidy is preferable to export tax in some cases in the framework of Bertrand-Nash equilibrium, considering the uncertainty in demand. Historically, many economists mentioned non-linear subsidy or tax. However, optimum solution of it has not yet been shown. The optimum solution is shown in this paper.Trade policy, Exports, Taxation, Strategic trade policy, Non-linear subsidy, Bertrand-Nash equilibrium, Stackelberg equilibrium

A McKean-Vlasov approach to distributed electricity generation development

This paper analyses the interaction between centralised carbon emissive technologies and distributed intermittent non-emissive technologies. In our model, there is a representative consumer who can satisfy her electricity demand by investing in distributed generation (solar panels) and by buying power from a centralised firm at a price the firm sets. Distributed generation is intermittent and induces an externality cost to the consumer. The firm provides non-random electricity generation subject to a carbon tax and to transmission costs. The objective of the consumer is to satisfy her demand while mini\-mising investment costs, payments to the firm and intermittency costs. The objective of the firm is to satisfy the consumer's residual demand while minimising investment costs, demand deviation costs, and maximising the payments from the consumer. We formulate the investment decisions as McKean-Vlasov control problems with stochastic coefficients. We provide explicit, price model-free solutions to the optimal decision problems faced by each player, the solution of the Pareto optimum, and the Stackelberg equilibrium where the firm is the leader. We find that, from the social planner's point of view, the carbon tax or transmission costs are necessary to justify a positive share of distributed capacity in the long-term, whatever the respective investment costs of both technologies are. The Stackelberg equilibrium is far from the Pareto equilibrium and leads to an over-investment in distributed energy and to a much higher price for centralised energy