Abstract: We first study the  $\tau$-value for graph-restricted games and provide its explicit construction.
The one-point solution could be considered as a natural extension of the  $\tau$-value introduced by
Tijs for classical cooperative games. When the cooperation graph is complete, the  $\tau$-value for
graph-restricted games coincides with the  $\tau$-value for classical cooperative games. Then we
provide an axiomatization of the  $\tau$-value for graph-restricted games via component efficiency,
 relative invariance under S-equivalence and restricted proportionality. The last section introduces
 the  $\tau$-value for two special classes of graph-restricted games.

Key words: graph-restricted games, $\tau$-value, quasibalanced, component efficiency