The paper deals with a temporal multi-agent logic TMAZ, which imitates taking of decisions based on agents' access to knowledge by their interaction. The interaction is modelled by possible communication channels between agents in special temporal Kripke/hintikka-like models. The logic TMAZ distinguishes local and global decisions-making. TMAZ is based on temporal Kripke/hintikka models with agents' accessibility relations defined on states of all possible time clusters C(i) (where indexes i range over all integer numbers Z). The main result provides a decision (...) algorithm for TMAZ (so, we prove that TMAZ is decidable). This algorithm also solves the satisfiability problem. In the final part of the paper, we consider the admissibility problem for inference rules in TMAZ, and show that this problem is decidable for TMAZ as well. (shrink)