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
Approximation of Walrasian equilibrium in single-minded auctions
Theoretical Computer Science
Majority equilibrium of distribution centers allocation in supply chain management
WINE'05 Proceedings of the First international conference on Internet and Network Economics
Hi-index | 0.00 |
In this work, we consider the public facility allocation problem decided through a voting process uner the majority rule. A locations of the public facility is a majority rule winner if there is no other location in the network where more than half of the voters would have be closer to than the majority rule winner. We develop fast algorithms for interesting cases with nice combinatorial structures. We show that the general problem, where the number of public facilities is more than one and is consider part of the input size, is NP-hard. Finally, we discuss majority rule decision making for related models.