竞争性多查询组合规划器

balanced = relevance × value × feasibility × gap × stability × overlap ÷ change-cost

value-first = balanced × value; stability-first = balanced × stability; inputs = 0–10; allocation = proportional largest remainder

这是规划模型，不是均衡、流量预测或排名承诺。