234 search results - page 2 / 47 » Games and Capacities on Partitions |
CIE
2007
Springer
15 years 6 months ago
2007
Springer
Ballester has shown that the problem of deciding whether a Nash stable partition exists in a hedonic game with arbitrary preferences is NP-complete. In this paper we will prove tha...
110
click to vote
MOBICOM
2009
ACM
15 years 6 months ago
2009
ACM
The capacity scaling property specifies the changes in network throughput when network size increases and serves as an essential performance evaluation metric for large-scale wir...
JCIT
2008
15 years 10 days ago
2008
This paper proposes a packet partition scheduling mechanism for bandwidth aggregation over end-to-end multi-path through multiple network interfaces. The proposed mechanism effect...
99
Voted
CORR
2010
Springer
15 years 14 days ago
2010
Springer
We conduct a computational analysis of partitions in additively separable hedonic games that satisfy standard criteria of fairness and optimality. We show that computing a partiti...
126
click to vote
MANSCI
2007
15 years 7 days ago
2007
This paper studies the impact of competition on a firm’s choice of technology (product-flexible or product-dedicated) and capacity investment decisions. Specifically, we mode...