A distributed method for dynamically assigning time/frequency resources organized in disjoint classes to station groups named "interfaces" comprising at least two stations, said stations comprising a transmitter/receiver and communicating with each other by means of signaling capacities, one class comprising C allocations, each group of stations comprising an allocation table Tsi, each group of stations exchanges this allocation table Tsi by means of a signaling protocol with the groups of stations that are defined as being in conflict with said group by a constraints graph, a graph of constraints between the groups indicating for a given group of stations A the groups of stations that may not have allocations of a same class as the allocations of said group A, first kind conflict between groups, and the groups of stations that are not in the first kind conflict with said group A but which, if they use allocations from a same class as the class of group A, must use different allocations in this class to the allocations used by said group A, second kind conflict between groups, the method using an arbitration function to settle the conflicts and the assignments of the allocations between the groups in conflict according to the constraints graph, characterized in that it comprises at least the following steps: • each interface Ji transmits the allocation table TJi associated with it to the interfaces K indicated as being in conflict in the constraints graph, • an interface Ji looks, for each allocation AJi that it has entered in its table TJi, whether the allocation AJi is used in the table received from an interface K that is in conflict, • the interface Ji uses the arbitration function to modify the allocation AJi in the table TJi, and in that : • if an allocation is used according to the allocation tables by an interface K and an interface J, and if J observes that the interface K is winning according to the arbitration function, by deletion in the two allocation tables, and if the conflict is of the first kind, then J deletes the allocation Aji in the allocation table of the interface J. • if an allocation is used according to the allocation tables by an interface K and an interface J, and if J observes that the interface K is winning according to the arbitration function, by deletion in the two allocation tables, and if the conflict is of the second kind, then the class of the allocation AJi is preserved in the table TJi and the allocation in the class is changed, if there is an allocation in this class without the second kind conflict, otherwise this allocation is deleted. • each interface Ji transmits the allocation table TJi associated with it to the interfaces K indicated as being in conflict in the constraints graph, • an interface Ji looks, for each allocation AJi that it has entered in its table TJi, whether the allocation AJi is used in the table received from an interface K that is in conflict, • the interface Ji uses the arbitration function to modify the allocation AJi in the table TJi, and in that : • if an allocation is used according to the allocation tables by an interface K and an interface J, and if J observes that the interface K is winning according to the arbitration function, by deletion in the two allocation tables, and if the conflict is of the first kind, then J deletes the allocation Aji in the allocation table of the interface J. • if an allocation is used according to the allocation tables by an interface K and an interface J, and if J observes that the interface K is winning according to the arbitration function, by deletion in the two allocation tables, and if the conflict is of the second kind, then the class of the allocation AJi is preserved in the table TJi and the allocation in the class is changed, if there is an allocation in this class without the second kind conflict, otherwise this allocation is deleted. <EOS>