The problem of sampling exchangeable random variables arises in many Bayesian inference tasks, especially in data imputation given a privatized summary statistics. These permutation-invariant joint distributions often have dependency structures that make sampling challenging. Component-wise sampling strategies, such as Metropolis-within-Gibbs, can mix slowly because they consider only comparing a proposed point with one component at a time. In this work, we propose a novel Single-Offer-Multiple-Attempts (SOMA) sampler that is tailored to sampling permutation invariant distributions. The core intuition of SOMA is that a proposed point unsuitable to replace one component might still be a good candidate to replace some other component in the joint distribution. SOMA first makes a singer offer, and then simultaneously considers attempts to replace each component of the current state with the single offer, before making the final acceptance or rejection decision. We provide an acceptance lower bound of SOMA and, using a coupling method, derive the convergence rate upper bound of SOMA in the two-dimensional case. We validate theoretical findings with numerical simulations, including a demonstration on differentially private Bayesian linear regression.