On the complexity of cooperative solution concepts
Mathematics of Operations Research
On the complexity of equilibria
STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Decision-Making by Hierarchies of Discordant Agents
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
On Computation of Arbitrage for Markets with Friction
COCOON '00 Proceedings of the 6th Annual International Conference on Computing and Combinatorics
Majority equilibrium for public facility allocation
COCOON'03 Proceedings of the 9th annual international conference on Computing and combinatorics
Hi-index | 0.00 |
In this paper, we consider the distribution center allocation problem decided through an optimal utility value under the majority rule in supply chain management. A location of the distribution center is a majority rule winner with optimal utility value if no other location in the network where more than half of the retailers would have, is with better utility value than the winner. We define a weight function and established the network model for the cases with one or even more than one distribution centers to be located. We show that there exists a modified weak quasi-Condorcet winner if the distribution center allocation graph model is a tree. Based on above discussion we proposed an practical majority equilibrium method for general distribution center allocation problems.