In this paper, we propose a decentralized, robust, highly available, and scalable infrastructure to match incoming jobs to available resources. Through a comparative analysis of three different types of matchmaking algorithms under different workload scenarios, we show the trade-offs between efficient matchmaking and good load balancing in a fully decentralized heterogeneous computational environment.