In a cost-sharing problem, finitely many players have unknown valuations for some service, and a mechanism is sought for determining which players to serve and how to distribute the incurred cost. An ideal mechanism is collusion-resistant (elicits truthful valuations even if players could collude), budget-balanced (recovers the cost), economically efficient (trades off cost and valuations), and...

Given a weighted directed network G, we consider the problem of computing k balanced paths from given source nodes to given destination nodes of G, i.e. k paths such that the difference in cost between the longest and the shortest path is minimized. The special case in which G is an acyclic network was theoretically investigated in [3]. It was proved that, in such a special case, the balanced p...

collection of municipal solid waste (msw) accounts for a significant proportion of most municipal budgets, and has drawn some degree of researchers‟ interest. this study was conducted in ota, southwest nigeria, to explore the use of visual basic program as an innovative tool to select the most economic haulage system among three systems found in literature (conventional-, modified- and stationa...

Roughgarden and Sundararajan recently introduced an alternative measure of efficiency for cost sharing mechanisms. We study cost sharing methods for combinatorial optimization problems using this novel efficiency measure, with a particular focus on scheduling problems. While we prove a lower bound of Ω(logn) for a very general class of problems, we give a best possible cost sharing method for m...

Recent advances in low-end processor and network technology have made it possible to build a "supercomputer" out of commodity components. We develop simple models of the NAS Parallel Benchmarks version 2 (NPB 2) to explore the cost/performance trade-offs involved in building a balanced parallel computer supporting a scientific workload. We develop closed form expressions detailing the number an...

Load balancing algorithms improve a program’s performance on unbalanced datasets, but can degrade performance on balanced datasets, because unnecessary load redistributions occur. This paper presents a cost-effective data-parallel load balancing algorithm which performs load redistributions only when the possible savings outweigh the redistribution costs. Experiments with a data-parallelpolygon...

Load balancing algorithms improve a program's performance on unbalanced datasets, but can degrade performance on balanced datasets, because unnecessary load redistributions occur. This paper presents a cost-eeective data-parallel load balancing algorithm which performs load redistributions only when the possible savings outweigh the redistribution costs. Experiments with a data-parallel polygon...