The paper considers an extension of the original Shapley and Shubik (1972) two-sided matching problem to the case of multisided matching with transfereable utility. We investigate existence and properties of stable matchings using the approach of cooperative game theory.

Tax compliance is modelled as a Bayesian Nash equilibrium in a costly state verification game with imperfect auditing. Neither the tax payer nor the auditor can measure the tax payer's true liability precisely: they observe independent noisy signals.