In (j,k)-games each player chooses amongst j ordered options and there are k possible outcomes. In this paper, we consider the case where players are assumed to prefer some outcomes to others, and note that when k>2 the players have an incentive to vote strategically. In doing so, we combine the theory of cooperative game theory with social choice theory, especially the theory of single-peaked preferences. We define the concept of a (j,k)-game with preferences and what it means for it to be manipulable by a player. We also consider Nash equilibriums with pure strategies for these games and find conditions that guarantee their existence.