When are Welfare Guarantees Robust?
I-CORE DAY 2016 INBAL TALGAM-COHEN (I (I-CORE POST-DOC) BASED ON JOINT WORK WITH TIM ROUGHGARDEN & & JAN VONDRAK
When are Welfare Guarantees Robust? I-CORE DAY 2016 INBAL - - PowerPoint PPT Presentation
When are Welfare Guarantees Robust? I-CORE DAY 2016 INBAL TALGAM-COHEN (I (I-CORE POST-DOC) BASED ON JOINT WORK WITH TIM ROUGHGARDEN & & JAN VONDRAK The Welfare Maximization Problem Central problem in AGT; interesting
I-CORE DAY 2016 INBAL TALGAM-COHEN (I (I-CORE POST-DOC) BASED ON JOINT WORK WITH TIM ROUGHGARDEN & & JAN VONDRAK
Central problem in AGT; interesting algorithmically
Setting: 𝑛 items, 𝑜 buyers, valuation functions 𝑤1, … , 𝑤𝑜 𝑤𝑗(bundle 𝑇𝑗 of items) = value of buyer 𝑗 for 𝑇𝑗 Monotonicity: 𝑤𝑗 𝑇𝑗 ≤ 𝑤𝑗 𝑈𝑗 whenever 𝑇𝑗 ⊂ 𝑈𝑗 The algorithmic problem: Given oracle access to the valuations Output an allocation of items 𝑇1, … , 𝑇𝑜 Goal: maximize welfare σ𝑗∈𝑂 𝑤𝑗(𝑇𝑗)
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
2
Monotone Submodular Gross Substitutes
Linear
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
3
𝑤𝑗 is linear 𝑤𝑗′ is submodular
Valuations Welfare Maximization Gross substitutes Easy Submodular (more generally, complement-free) Easy to approximate within constant General Hard
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
4
Substitutes (“coffee and tea” rather than “coffee and cream") are a very central but stringent assumption
For mechanism and market design: Example supporting folklore belief: Spectrum auctions seem to work…
Valuations with a dominant substitutes component??? (Gross) Substitutes Complements
“Easy” “Hard”
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
5
Agenda: Evaluate rigorously whether the main takeaways from the study
approximately
This work (ongoing): Evaluate whether the nice algorithmic properties hold Meta-question: Is algorithmic approximation tied to economic approximation?
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
6
For a natural notion of 𝜗-close to gross substitutes: Negative results in the value query model
Positive results with
Bottom line: The main take-aways for GS don’t hold AS IS. Standard methods may fail. A more delicate story waiting to be uncovered?
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
7
[Karande-Devanur’07]: For divisible items, “markets do not suddenly become intractable if they slightly violate the weak GS property” [Singer-Hassidim’16]: Robust welfare maximization for submodular valuations; related techniques [Lehmann-Lehmann-Nisan’06, Feige et al ’14]: Notions of closeness to submodular (and more general) valuations
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
8
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
9
Let Ԧ 𝑞 ≤ Ԧ 𝑟 be vectors of item prices A bundle 𝑇 is in demand given Ԧ 𝑞 if it maximizes the utility 𝑤𝑗 𝑇 − 𝑞(𝑇) 𝑤𝑗 is GS if:
𝑞,
𝑟 which contains every 𝑘 ∈ 𝑇 whose price didn’t increase
Seems brittle…
$ $ $ $
𝑻 𝑼
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
10
Subclass: 𝑤𝑗 is linear if there is a vector Ԧ 𝑏 of item values such that 𝑤𝑗 𝑇 = 𝑑 + σ𝑘∈𝑇 𝑏𝑘
Superclass: 𝑤𝑗 is submodular if its marginal values 𝑤𝑗 𝑘 ∣ 𝑇 = 𝑤𝑗 𝑘 ∪ 𝑇 − 𝑤𝑗(𝑇) are decreasing 𝑤𝑗 𝑘 ∣ 𝑈 ≥ 𝑤𝑗 𝑘 ∣ 𝑇 whenever 𝑈 ⊂ 𝑇
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
𝑻 𝑼 𝒌
11
Idea: 𝑤 is a 2𝑛-vector of values; add small pointwise perturbations
Definition: 𝑤 is 𝜗-close to GS if there is a GS valuation 𝑤′ such that 𝑤′ 𝑇 ≤ 𝑤 𝑇 ≤ 1 + 𝜗 𝑤′(𝑇) for every 𝑇 Main question, restated: Do the laudable properties of gross substitutes degrade gracefully with 𝜗? (e.g. can welfare be approximated up to 1 − 𝜗 ?) Focus in this talk: 𝜗-close to linear
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
12
Monotone
Submodular GS Linear 𝑤 is 𝜗-close to linear - hard 𝑤 is 𝜗-close to linear but also (close to) submodular - easy
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
13
2 types of oracle access to valuations: In general: A value query reduces to poly-many demand queries
For GS:
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
14
Value Oracle Demand Oracle
𝑇 𝑤(𝑇) Ԧ 𝑞 𝑇 in demand
Value Oracle
poly- many
Welfare-Max Algo
GS
allocation
For 𝜗-close to GS: we show 2 impossibilities Conclusion: No sweeping generalization of GS properties
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
15
Value Oracle Welfare-Max Algo
𝜗-close to GS subpoly- approximation
Demand Oracle
Ԧ 𝑞 𝑇 in demand
Value Oracle
subexp- many subexp- many
If 𝑤 is 𝜗-close to additive (𝑤′ 𝑇 = σ𝑘∈𝑇 𝑏𝑘)
If 𝑤 is 𝜗-close to linear (𝑤′ 𝑇 = 𝑑 + σ𝑘∈𝑇 𝑏𝑘)
Possible solution: Strengthen notion of approximate GS so marginals are approximated ⟹ From pointwise approximation to approximation at marginal level
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
16
Notation: Marginal 𝑤(𝑘| ⋅) maps 𝑇 to 𝑤 𝑘 𝑇 Definition: 𝑤 is marginal-𝜗-close to decreasing if ∀𝑘 ∶ 𝑤(𝑘| ⋅) is 𝜗-close to decreasing Definition [LLN’06]: 𝑤 is 𝛽-submodular 𝛽𝑤 𝑘 ∣ 𝑈 ≥ 𝑤 𝑘 ∣ 𝑇 whenever 𝑈 ⊂ 𝑇 Proposition: For 𝜗-close to linear and 𝛽-submodular valuations, greedy achieves a
1−3𝜗 𝛽 -approximation to welfare with value queries in poly-time
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
17
𝑻 𝑼 𝒌
Equivalent for 𝜷 = 𝟐 + 𝝑
Optimal welfare can be estimated with demand queries: Proposition: For every class 𝐷 of valuations for which the integrality gap of the configuration LP is 𝛿, can estimate welfare within (1 + 𝜗)𝛿 for 𝜗-close to 𝐷 Oblivious rounding techniques (linear, XOS) also enable approximation
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
18
Configuration
LP
GS Fractional allocation Integrality gap = 1
Configuration
LP
𝜗-close to GS Fractional allocation Integrality gap = 1 + 𝜗
Demand Oracle Demand Oracle
Proposition: Approximation guarantee of Kelso-Crawford ascending auction degrades gracefully for 𝜗-close to subclasses of GS In general, can fail miserably…
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
19
Ideally, approximation guarantees degrade gracefully under small deviations Negative results for 𝜗-close to linear with value queries ⟹ No “generic reason” for belief that “close to substitutes is easy” Positive results for 𝜗-close to linear with additional structure or demand queries ⟹ It matters how closeness is defined ⟹ Robust results can require new ideas
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
20
[Lehmann-Lehmann-Nisan’06]: “This paper’s main message is that the case of submodular valuation functions should be the focus of interest.” Led to a lot of groundbreaking research over past decade It’s a good time to be working on GS (and its approximations)… [Hsu et al. ‘16; Paes Leme and Wong ’16; Cohen-Addad et al ’16; …]
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
21
1) Is it possible to get a more sweeping positive result? E.g. for
2) Do nice economic aspects of GS hold for 𝜗-close to GS?
auction formats
T.C.’14 Roughgarden-T.C.’15]
TALGAM-COHEN WHEN ARE WELFARE GUARANTEES ROBUST?
22