This document investigates the client assignment problem for maximizing interactivity in distributed interactive applications (DIAs) by analyzing factors such as network latencies and synchronization delays. It proposes three heuristic algorithms, particularly highlighting the greedy and distributed-modify assignment algorithms, which improve interaction time significantly compared to traditional nearest-server assignments. The study also details system requirements and evaluates the performance of the algorithms using real internet latency data.