At the Medium Access Control (MAC) layer, coordinating the transmissions of nodes is necessary to avoid collisions and thereby achieve efficient channel utilization. Coordination among nodes can be achieved by using control messages as in TDMA, but the distributed nature of wireless networks makes the usage of control messages burdensome. This work proposes a method to achieve coordination among nodes without relying on control messages, using a framework of repeated games with bounded recall. The main idea is that each node determines a transmission probability depending on its history containing its transmission actions and feedback information. We introduce two performance metrics, throughput and average delay, and formulate the problem of finding an optimal protocol. We first show that a TDMA outcome, which is the best outcome in the considered scenario, can be obtained after a transient period by a protocol with (N-1)-slot memory, where N is the total number of users. Next, we analyze the performance of protocols with 1-slot memory using a Markov chain and numerical methods. Protocols with 1-slot memory can achieve throughput arbitrarily close to 1 (i.e., 100% channel utilization) at the expense of large average delay, by correlating successful users in two consecutive slots. Finally, we show how this framework can be applied to wireless local area networks.