Strategic Manipulation Approach for Solving Negotiated Transfer Pricing Problem

This paper suggests an approach for solving the transfer pricing problem, where negotiation between divisions is carried out considering the manipulation game theory model for a multidivisional firm. The manipulation equilibrium point is conceptualized under the Machiavellian social theory, represented by three concepts: views, tactics and immorality. In this approach, we are considering a non-cooperative model for the transfer pricing problem: a game model involving manipulating and manipulated players engaged cooperatively in a Nash game, restricted by a Stackelberg game. The cooperation is represented by the Nash bargaining solution. The transfer pricing problem is conceptualized as a strong Stackelberg game involving manipulating and manipulated divisions. This structure established conditions of unequal relative power among divisions, where high-power divisions tend to be abusive and less powerful divisions have a tendency to behave compliantly. For computation purposes, we transform the Stackelberg game model into a Nash game, where every division is able of manipulative behavior to some degree: the Nash game relaxes the interpretation of the manipulation game and the equilibrium selection for the transfer pricing problem. The manipulation dynamics and rationality proposed for the transfer pricing problem correspond to many real-world negotiation situations. We present an example, that illustrates how manipulation can be employed to solve the transfer pricing problem in a multidivisional firm.     

Dynamic resource allocation in fuzzy coalitions: a game theoretic model

We introduce an efficient and dynamic resource allocation mechanism within the framework of a cooperative game with fuzzy coalitions (cooperative fuzzy game). A fuzzy coalition in a resource allocation problem can be so defined that membership grades of the players in it are proportional to the fractions of their total resources. We call any distribution of the resources possessed by the players, among a prescribed number of coalitions, a fuzzy coalition structure and every membership grade (equivalently fraction of the total resources), a resource investment. It is shown that this resource investment is influenced by the satisfaction of the players in regard to better performance under a cooperative setup. Our model is based on the real life situations, where possibly one or more players compromise on their resource investments in order to help forming coalitions.     

基于LSMC模型的煤炭资源价值定价研究

煤炭资源价值定价可以抽象为一种美式期权定价问题.最小二乘蒙特卡洛模拟(LSMC)方法是解决美式期权定价问题的一个有效途径.详尽地分析了Cortazar等人的基于资源价格、利率和便利收益随机变动的三因素定价模型,利用向量Ito定理提出了三因素模型中价格、利率和便利收益变量的递推公式.对LSMC方法原理进行了细致的阐述,总结出实现LSMC方法的完整过程,并在Matlab环境下编制了LSMC算法实现程序,进行算例计算.算例结果表明,LSMC方法用于资源定价是有效可靠的.研究为煤炭资源价值定价提供了一个完整具有可操作性的工具.     

Constraint Programming-based Column Generation

This paper surveys recent applications and advances of the Constraint Programming-based Column Generation framework, where the master subproblem is solved by traditional OR techniques, while the pricing subproblem is solved by Constraint Programming. This framework has been introduced to solve crew assignment problems, where complex regulations make the pricing subproblem demanding for traditional techniques, and then it has been applied to other contexts. The main benefits of using Constraint Programming are the expressiveness of its modeling language and the flexibility of its solvers. Recently, the Constraint Programming-based Column Generation framework has been applied to many other problems, ranging from classical combinatorial problems such as graph coloring and two dimensional bin packing, to application oriented problems, such as airline planning and resource allocation in wireless ad-hoc networks.     

Constraint programming-based column generation

This paper surveys recent applications and advances of the constraint programming-based column generation framework, where the master subproblem is solved by traditional OR techniques, while the pricing subproblem is solved by constraint programming (CP). This framework has been introduced to solve crew assignment problems, where complex regulations make the pricing subproblem demanding for traditional techniques, and then it has been applied to other contexts. The main benefits of using CP are the expressiveness of its modeling language and the flexibility of its solvers. Recently, the CP-based column generation framework has been applied to many other problems, ranging from classical combinatorial problems such as graph coloring and two dimensional bin packing, to application oriented problems, such as airline planning and resource allocation in wireless ad hoc networks.      

Dynamic Network-Based Discriminatory Pricing

We study the dynamic pricing decisions for competitive network service providers. We assume that each competing firm follows a three-part pricing scheme, which consists of an ongoing membership fee, a usage fee for communications within the networks, and another usage fee for communications across the networks. The difference between the two usage fees is the network-based price discount that allows price discrimination. We study the firms problems as a differential game and establish the optimal pricing policy as a Nash equilibrium feedback strategy depending on only the network sizes (i.e., the number of subscribers). We compare the dynamic network-based discount with the static discount. In the special case of a uniform calling pattern, we find that the firm network-based dynamic discount is always lower than the static discount; we find also that the firm that has a larger network can offer a bigger discount. These results are useful particularly for managers. To get further insights into the dynamic pricing policies, we explore the case of symmetric competition using numerical simulation.Communicated by G. Leitmann     

Cooperative and Non-Cooperative Differential Game Solutions to an Investment and Pricing Problem

A monopoly possesses a finite stock of a resource and wishes to determine an optimal pricing policy. The competitive fringe invests in production capacity and wishes to select an optimal investment rate. Demand towards the monopoly depends on price as well as on the sales rate of the competition. Modelling the situation as a differential game, non-cooperative (Nash and Stackelberg) and cooperative (Pareto) equilibria are determined. Owing to the special structure of the game, these solutions can be found in closed form.     

二级供应链上不完美互补产品的定价决策

建立一个由两个制造商和一个零售商组成供应链模型,以求解制造商和零售商的最优定价决策,其中两个制造商向零售商批发的产品是不完美互补的,且零售商采取混合捆绑策略销售这两种产品。考虑三种情形下的决策:(1)完全非合作博弈;(2)局部合作博弈;(3)合作博弈。通过比较前两种情形下的决策,利用Nash协商模型求解得到消除水平和垂直供应链冲突的最优定价决策。与完全非合作博弈决策相比,局部合作博弈决策对制造商是有利的,在一定的条件下也可以实现对零售商收益的帕累托改进;而合作博弈决策在任何情况下都要明显地优于完全非合作博弈决策以及局部合作博弈决策,同时合作博弈决策下的最优产品需求量相比局部合作博弈决策下的最优产品需求量提高了一倍。最后,通过数值试验验证了文章所得结论。     

Generalising diagonal strict concavity property for uniqueness of Nash equilibrium

In this paper, we extend the notion of diagonally strictly concave functions and use it to provide a sufficient condition for uniqueness of Nash equilibrium in some concave games. We then provide an alternative proof of the existence and uniqueness of Nash equilibrium for a network resource allocation game arising from the so-called Kelly mechanism by verifying the new sufficient condition. We then establish that the equilibrium resulting from the differential pricing in the Kelly mechanism is related to a normalised Nash equilibrium of a game with coupled strategy space.     

Games of timing with resources of mixed type

The paper considers a game of timing which is closely related to the so-called duels. This is a game connected with the distribution of resources by two players. Each of the players is in possession of some amount of resource to be distributed by him in the time interval [0, 1]. In his behavior, Player 1 is restricted by the necessity of taking all of his resources at a single point, while Player 2 has no restrictions. For the payoff function, defined as for duels, the game is solved; explicit formulas on the value of the game and the optimal strategies for the players are found.     

A review of multi-product pricing models

The importance of good pricing strategies in business theory is clearly recognized, as can be seen from the huge volume of pricing research done over the years. What we attempt to do is to provide a general review of multi-product pricing models, focusing primarily on those where demands are explicitly dependent on prices. As the pricing decision may be made jointly with other economic parameters, we will not only review models that focus solely on pricing; we will also discuss models where pricing choices are made jointly with other decisions like production or distribution of resources.     

CONFLICT AND COOPERATION IN UTILIZING A COMMON PROPERTY RESOURCE

Noncooperative games are used to demonstrate that, while free riding is always an option, the “tragedy of the commons” is not inevitable. When the decision to cooperate or free ride is considered in a dynamic setting, there is no intermediate case where some cooperate and others free ride. The game is only stabilized in either full cooperation or full defection. The important factor in obtaining a cooperative outcome is the critical number of players that decide to cooperate. The concept of commitment is used to demonstrate the necessary and sufficient conditions for full cooperation. Although the analysis is based on a shared water resource, it can be extended to other natural resources with common costs and private benefits, especially in the cases where there are no international authorities or treaties that internalize the externalities involved in privatizing the resource.     

Pricing problems with a continuum of customers as stochastic Stackelberg games

The pricing problem where a company sells a certain kind of product to a continuum of customers is considered. It is formulated as a stochastic Stackelberg game with nonnested information structure. The inducible region concept, recently developed for deterministic Stackelberg games, is extended to treat the stochastic pricing problem. Necessary and sufficient conditions for a pricing scheme to be optimal are derived, and the pricing problem is solved by first delineating its inducible region, and then solving a constrained optimal control problem.The research work reported here as supported in part by the National Science Foundation under Grant ECS-81-05984, Grant ECS-82-10673, and by the Air Force Office of Scientific Research under AFOSR Grant 80-0098.     

不同博弈框架下多竞争零售商的双渠道供应链定价决策研究

在Bertrand竞争、Stackelberg竞争及集中决策下,研究由单制造商与多竞争零售商组成的双渠道供应链的定价决策问题。运用两阶段优化技术、博弈论及矩阵论,讨论了多竞争零售商与单制造商在价格方面相互竞争的问题,给出不同市场竞争模式及集中决策下供应链成员的博弈均衡解。对比不同博弈框架及集中决策下供应链成员的定价决策,通过数值实验分析了价格敏感度及零售商个数对最优定价决策和最大利润影响,给出一些管理学理论与见解,为双渠道供应链中各成员的管理者制定最优决策提供理论支持。     

Modeling of uplink power control for cognitive radio networks: Cooperative and noncooperative

In this paper, the uplink power control problem is modeled by considering both cooperative and noncooperative methods respectively to protect licensed users in cognitive radio networks. The cooperative power control optimization problem is modeled as a concave minimization problem. According to the properties of the power control optimization problem, an improved branch and bound algorithm is proposed. On the other hand, for the noncooperative power control case, a game theoretic model with the exponential pricing function is adopted to restrict the interference to the licensed users. Further, Nash equilibrium for the power control game is discussed. Finally, the performance of the proposed models is evaluated by computer simulation.     

NONMARKET RESOURCE VALUATION: A BILEVEL OPTIMIZATION APPROACH

The social value of a common property/open access resource is in general different from the value attributed by individual users. Therefore, public intervention in the form of prices, quotas and marketable licenses has often been necessary to prevent overexploitation of such resources. This paper addresses the pricing issue. The existing mathematical programming studies in the resource economics literature suggest using the shadow price information obtained from an aggregate model where the sum of net returns to individual users and the management authority is maximized. When the policy maker's objective takes a different form, however, the shadow price strategy may result in a socially suboptimum or infeasible resource utilization. A bilevel optimization approach is proposed in this paper where the price of the resource is introduced as a policy variable and the optimizing behavior of individual users is considered as an explicit constraint in a global optimization problem. An empirical application of the proposed approach to the steady state management of a large scale irrigation system is presented.     

Price coordination in distribution channels: A dynamic perspective

In this study, we investigate two important questions related to dynamic pricing in distribution channels: (i) Are coordinated pricing decisions efficient in a context where prices have carry-over effects on demand? (ii) Should firms practice a skimming or a penetration strategy if they choose to coordinate or to decentralize their activities? To answer these questions, we consider a differential game that takes place in a bilateral monopoly where the past retail prices paid by consumers contribute to the building of a reference price. The latter is used by consumers as a benchmark to evaluate the value of the product, and by firms to decide whether to adopt a skimming or a penetration strategy.     

Effect of local information within network layers on the evolution of cooperation in duplex public goods games

Traditional works of public goods game (PGG) are often studied in simplex networks where agents play games through the same type of social interactions. In order to promote cooperation against the defection in PGGs in simplex network environment, many mechanisms have been proposed from different perspectives, such as the volunteering mechanisms, and the punishment and reward approaches. However, due to diverse types of interactions between agents in reality, the study of PGG should also consider the characteristic of multiplexity of networks. Hence, we firstly model the public goods game in the duplex network (for simplification of analysis, the duplex network is considered), in which agents have two types of social interactions, and thus the network is modeled as two network layers. This type of PGG is naturally named as duplex public goods game (D-PGG), in which agents can select one of the network layers to allocate their limited resources. Then for the new game environment (D-PGG), we propose a novel perspective to promote cooperation: degrading the information integrity, i.e., agents get information just from one network layer (local information) rather than from the whole duplex network (global information) in the evolution process. Finally, through theoretical analyses and simulations, we find that if agents imitate based on the local information of the payoff in the evolution, cooperation can be generally promoted; and the extent of promotion depends on both the network structure and the similarity of the network layers.     

Computation of equilibria and the price of anarchy in bottleneck congestion games

We study Nash and strong equilibria in weighted and unweighted bottleneck games. In such a game every (weighted) player chooses a subset of a given set of resources as her strategy. The cost of a resource depends on the total weight of players choosing it and the personal cost every player tries to minimize is the cost of the most expensive resource in her strategy, the bottleneck value. To derive efficient algorithms for finding equilibria in unweighted games, we generalize a transformation of a bottleneck game into a congestion game with exponential cost functions introduced by Caragiannis et al. (2005). For weighted routing games we show that Greedy methods give Nash equilibria in extension-parallel and series-parallel graphs. Furthermore, we show that the strong Price of Anarchy can be arbitrarily high for special cases and give tight bounds depending on the topology of the graph, the number and weights of the users and the degree of the polynomial latency functions. Additionally we investigate the existence of equilibria in generalized bottleneck games, where players aim to minimize not only the bottleneck value, but also the second most expensive resource in their strategy and so on.