Learning Optimal Dynamic Matching via Graph Neural Networks
The results show that residual-graph value learning yields state-dependent dynamic matching policies that adapt to realized connectivity and exit information.
We have 2 of 4 papers
We haven’t gathered this author’s papers yet. Follow them and we’ll fetch their work.
Not the right person? Other researchers publish under this name.
The results show that residual-graph value learning yields state-dependent dynamic matching policies that adapt to realized connectivity and exit information.
We study the welfare-maximizing allocation of heterogeneous objects when screening uses costly effort rather than monetary transfers. No-screening mechanisms perform well as object variety increases. In a symmetric continuous market with i.i.d. values whose CDF is log-concave, the multidimensional problem reduces exact...
We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.