The paper introduces HGT, a batched bandit algorithm for network formation that learns latent types and complementarities via variational inference and updates pairings by maximum-weight matching.
(2014), Regret in online combinatorial optimization, Mathematics of Operations Research, 39, 31--45
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
econ.EM 1years
2025 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Batched Adaptive Network Formation
The paper introduces HGT, a batched bandit algorithm for network formation that learns latent types and complementarities via variational inference and updates pairings by maximum-weight matching.