This paper introduces a new variant of the Shortest Path Problem (SPP) called Cost-Balanced (CBPP). Various real problems can either be modeled as BCPP or include sub-problem. We prove several properties related to complexity CBPP problem. In particular, we demonstrate that problem is NP-hard in its general version, but it becomes solvable polynomial time specific family instances. Moreover, ma...

We consider the solution of matching problems with a convex cost function via a network flow algorithm. We review the general mapping between matching problems and flow problems on skew symmetric networks and revisit several results on optimality of network flows. We use these results to derive a balanced capacity scaling algorithm for matching problems with a linear cost function. The latter i...

Könemann, Leonardi, and Schäfer [14] gave a 2-budget-balanced and groupstrategyproof mechanism for Steiner forest cost-sharing problems. We prove that this mechanism also achieves an O(log k)approximation of the social cost, where k is the number of players. As a consequence, the KLS mechanism has the smallest-possible worst-case efficiency loss, up to constant factors, among all O(1)-budget-ba...

The rapid growth of Internet brings the need for a low cost high performance file system. Two objectives are to be pursued in building such a large scale storage system on multiple disks: load balancing and storage minimization. We investigate the optimization problem of placing variable-size data items onto multiple disks with replication to achieve the two objectives. An approximate algorithm...

A cost-sharing mechanism defines how to share the cost of a service among serviced customers. It solicits bids from potential customers and selects a subset of customers to serve and a price to charge each of them. The mechanism is group-strategyproof if no subset of customers can gain by lying about their values. There is a rich literature that designs group-strategyproof cost-sharing mechanis...

this research has done in order to identifying the human resource performance key indicator; qom province electricity distribution company with regard to integrated balanced scorecard approach of human resource and analytic hierarchy process .the research method of the article is descriptive and library field data collecting. balanced scorecard (bscj translated the company visions and strategie...

This paper proposes a cooperation protocol based on the cost-balanced strategy for the Object-Sorting Task in multi-agent robotic systems. The protocol coordinates agents for carrying objects to destinations efSiciently and effectively. Each agent autonomously makes subjective optimal decision, then the coordination algorithm resolves their conflicts by balancing the load, which is measured in ...

The cost-effectiveness of wormhole torus-networks is systematically evaluated with emphasis on new dynamically-balanced wormhole routing algorithms. These algorithms use balanced assignments of virtual channels to distribute the workload evenly throughout the network, resulting in significant performance improvement. In particular we enhance previous algorithms by removing the non-packet-co-res...

We consider the situation when a scarce renewable resource should be periodically distributed between different users by a Resource Management Authority (RMA). The replenishment of this resource as well as users demand is subject to considerable uncertainty. We develop cost optimization and risk management models that can assist the RMA in its decision about striking the balance between the lev...

In the residual∗ cost sharing game with a convex technology, the equilibrium demands maximize total surplus, but total payment may differ from the actual cost, and a user with a null demand may be subsidized. If the cost function is totally monotone (e.g., polynomial with positive coefficients, or exponential), participation is voluntary and total payment covers actual cost. The ratio of excess...