18 citations · 109 across the 28 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
cs.GT2023
Selling to Multiple No-Regret Buyers
Linda Cai, S. Matthew Weinberg, Evan Wildenhain +1
We consider the problem of repeatedly auctioning a single item to multiple i.i.d buyers who each use a no-regret learning algorithm to bid over time. In particular, we study the se…
cs.GT2023
q-Partitioning Valuations: Exploring the Space Between Subadditive and Fractionally Subadditive Valuations
Kiril Bangachev, S. Matthew Weinberg
For a set of elements, we define a decreasing chain of classes of normalized monotone-increasing valuation functions from to , parameterized by a…
cs.GT2023
Tight Bounds on 3-Team Manipulations in Randomized Death Match
Atanas Dinev, S. Matthew Weinberg
Consider a round-robin tournament on n teams, where a winner must be (possibly randomly) selected as a function of the results from the pairwise matches. A tourname…