Cost Sharing Mechanisms for Business Clusters with Strategic Firms

A business cluster is a co-located group of micro, small, medium scale enterprises. Such firms can benefit significantly from their co-location through shared infrastructure and shared services. Cost sharing becomes an important issue in such sharing arrangements especially when the firms exhibit strategic behavior. There are many cost sharing methods and mechanisms proposed in the literature based on game theoretic foundations. These mechanisms satisfy a variety of efficiency and fairness properties such as allocative efficiency, budget balance, individual rationality, consumer sovereignty, strategyproofness, and group strategyproofness. In this paper, we motivate the problem of cost sharing in a business cluster with strategic firms and illustrate different cost sharing mechanisms through the example of a cluster of firms sharing a logistics service. Next we look into the problem of a business cluster sharing ICT (information and communication technologies) infrastructure and explore the use of cost sharing mechanisms.

The reverse self-dual serial cost-sharing rule

In this study we define a cost sharing rule for cost sharing problems. This rule is related to the serial cost-sharing rule defined by Moulin and Shenker (1992). We give some formulas and axiomatic characterizations for the new rule. The axiomatic characterizations are related to some previous ones provided by Moulin and Shenker (1994) and Albizuri (2010).

Intermediate serial cost-sharing rules

In this paper we give a generalization of the serial cost-sharing rule defined by Moulin and Shenker (1992) for cost sharing problems. According to the serial cost sharing rule, agents with low demands of a good pay cost increments associated with low quantities in the production process of that good. This fact might not always be desirable for those agents, since those cost increments might be higher than others, for example with concave cost functions. In this paper we give a family of cost sharing rules which allocates cost increments in all the possible places in the production process. And we characterize axiomatically each of them by means of an axiomatic characterization related to the one given for the serial cost-sharing rule by Moulin and Shenker (1994).

Characterizing distribution rules for cost sharing games

In noncooperative cost sharing games, individually strategic agents choose resources based on how the welfare (cost or revenue) generated at each resource (which depends on the set of agents that choose the resource) is distributed. The focus is on finding distribution rules that lead to stable allocations, which is formalized by the concept of Nash equilibrium, e.g., Shapley value (budget-balanced) and marginal contribution (not budget-balanced) rules.

Recent work that seeks to characterize the space of all such rules shows that the only budget-balanced distribution rules that guarantee equilibrium existence in all welfare sharing games are generalized weighted Shapley values (GWSVs), by exhibiting a specific 'worst-case' welfare function which requires that GWSV rules be used. Our work provides an exact characterization of the space of distribution rules (not necessarily budget-balanced) for any specific local welfare functions remains, for a general class of scalable and separable games with well-known applications, e.g., facility location, routing, network formation, and coverage games.

We show that all games conditioned on any fixed local welfare functions possess an equilibrium if and only if the distribution rules are equivalent to GWSV rules on some 'ground' welfare functions. Therefore, it is neither the existence of some worst-case welfare function, nor the restriction of budget-balance, which limits the design to GWSVs. Also, in order to guarantee equilibrium existence, it is necessary to work within the class of potential games, since GWSVs result in (weighted) potential games.

We also provide an alternative characterization—all games conditioned on any fixed local welfare functions possess an equilibrium if and only if the distribution rules are equivalent to generalized weighted marginal contribution (GWMC) rules on some 'ground' welfare functions. This result is due to a deeper fundamental connection between Shapley values and marginal contributions that our proofs expose—they are equivalent given a transformation connecting their ground welfare functions. (This connection leads to novel closed-form expressions for the GWSV potential function.) Since GWMCs are more tractable than GWSVs, a designer can tradeoff budget-balance with computational tractability in deciding which rule to implement.

The minimal overlap cost sharing rule

In this paper we introduce a new cost sharing rule-the minimal overlap cost sharing rule-which is associated with the minimal overlap rule for claims problems defined by O'Neill (1982). An axiomatic characterization is given by employing a unique axiom: demand separability. Variations of this axiom enable the serial cost sharing rule (Moulin and Shenker, 1992) and the rules of a family (Albizuri, 2010) that generalize the serial cost sharing rule to be characterized. Finally, a family that includes the minimal overlap cost sharing rule is defined and obtained by means of an axiomatic characterization.

A study on the cost sharing model for supply lead time reduction with component commonality

This paper studies a two-level supply chain consisting of components supplier and product assembly manufacturer, while the manufacturer shares the investment on shortening supply lead time. The objective of this research is to investigate the benefits of cost sharing strategy and adopting component commonality. The result of numerical analysis demonstrates that using component commonality can help reduce the total cost, especially when the manufacture shares a higher fraction of the cost of investment in shortening supply lead time.

On international cost-sharing of pharmaceutical R&D

Ramsey pricing has been proposed in the pharmaceutical industry as a principle to price discriminate among markets while allowing to recover the (fixed) R&D cost. However, such analyses neglect the presence of insurance or the fund raising costs for most of drug reimbursement. By incorporating these new elements, we aim at providing some building blocks towards an economic theory incorporating Ramsey pricing and insurance coverage. We show how coinsurance affects the optimal prices to pay for the R&D investment. We also show that under certain conditions, there is no strategic incentive by governments to set coinsurance rates in order to shift the financial burden of R&D. This will have important implications to the application of Ramsey pricing principles to pharmaceutical products across countries.

Coherent Cost-Sharing Rules

We reconsider the discrete version of the axiomatic cost-sharing model. We propose a condition of (informational) coherence requiring that not all informational refinements of a given problem be solved differently from the original problem. We prove that strictly coherent linear cost-sharing rules must be simple random-order rules.

Responsibility and Cross-Subsidization in Cost Sharing

We propose two axiomatic theories of cost sharing with the common premise that agents demand comparable -though perhaps different- commodities and are responsible for their own demand. Under partial responsibility the agents are not responsible for the asymmetries of the cost function: two agents consuming the same amount of output always pay the same price; this holds true under full responsibility only if the cost function is symmetric in all individual demands. If the cost function is additively separable, each agent pays her stand alone cost under full responsibility; this holds true under partial responsibility only if, in addition, the cost function is symmetric. By generalizing Moulin and Shenker’s (1999) Distributivity axiom to cost-sharing methods for heterogeneous goods, we identify in each of our two theories a different serial method. The subsidy-free serial method (Moulin, 1995) is essentially the only distributive method meeting Ranking and Dummy. The cross-subsidizing serial method (Sprumont, 1998) is the only distributive method satisfying Separability and Strong Ranking. Finally, we propose an alternative characterization of the latter method based on a strengthening of Distributivity.

Ordinal Cost Sharing.

We ask how the three known mechanisms for solving cost sharing problems with homogeneous cost functions - the value, the proportional, and the serial mechanisms - should be extended to arbitrary problem. We propose the Ordinality axiom, which requires that cost shares be invariante under all transactions preserving the nature of a cost sharing problem.

An Axiomatization of the Serial Cost-Sharing Method

We o¤er an axiomatization of the serial cost-sharing method of Friedman and Moulin (1999). The key property in our axiom system is Group Demand Monotonicity, asking that when a group of agents raise their demands, not all of them should pay less.