Minimal Regret Walras Equilibria for Combinatorial Markets
We consider combinatorial multi-item markets and propose the notion of a ∆-regret Walras equilibrium, consisting of an allocation and item prices such that prices clear the market, the allocation is capacity-feasible, and the players’ strategies lead to a total regret of at most ∆. Regret is the sum of the players’ utility gaps relative to … Read more