Understanding how subsets of items are chosen from offered sets is critical to assortment planning, wireless network planning, and many other applications. There are two seemingly unrelated subset choice models that capture dependencies between items: intuitive and interpretable random utility models; and tractable determinantal point processes (DPPs). This paper connects the two. First, all DPPs are shown to be random utility models. Next, a determinantal choice model that enjoys the best of both worlds is specified; the model is shown to subsume logistic regression when dependence is minimal, and MNL when dependence is maximally negative. This makes the model interpretable, while retaining the tractability of DPPs. A simulation study verifies that the model can learn a continuum of negative dependencies from data, and an applied study using original experimental data produces novel insights on wireless interference in LoRa networks.

该研究介绍了一个同时拥有随机实用模型和确定性点过程的特点的确定性选择模型，该模型可以从数据中学习到一系列负面依赖关系，提供了一些关于LoRa网络无线干扰的新见解，该模型在子集选择模型、随机实用模型和确定性点过程中产生了应用价值。

可解释的行列式选择模型用于子集选择