Presentation is loading. Please wait.

Presentation is loading. Please wait.

Yi Wu IBM Almaden Research Joint work with Preyas Popat.

Similar presentations


Presentation on theme: "Yi Wu IBM Almaden Research Joint work with Preyas Popat."— Presentation transcript:

1 Yi Wu IBM Almaden Research Joint work with Preyas Popat

2

3 Buy cereal and milk if under 10$ Buy coffee and milk if under 7$ Buy coffee and alcohol if under 15$ How to price items to maximize profit?

4

5

6

7  Items are aligned on a line and each buyer is interested in buying a path (consecutive items). Driver 1 Driver 2 Driver 3

8

9 1 3 2 10 30

10 1 3 2 10 30 10 0 Profit is 40.

11 1 3 2 10 30 15 -5 15 Profit is 50. Loss leader

12  Definition: A loss leader is a product sold at a low price (at cost or below cost) to stimulate other profitable sales.  Example of loss leader ◦ Printer and ink ◦ E-book reader and E-book ◦ Movie ticket and popcorn and drink

13 What if the production cost is 0 such as the highway problem?

14

15 [Balcan-Blum 06]: The maximum profit can be log n-times more when loss leaders are allowed (under either coupon or discount model).

16  What kind of approximation is achievable for the item pricing problems with prices below cost allowed?

17  [Balcan-Blum-Chan-Hajiaghayi-07]: “Obtaining constant factor appropriation algorithms in the coupon model for general graph vertex pricing problem and the highway problem with arbitrary valuations seems believable but very challenging.”

18

19

20 Positive profit pricesLoss leaders Item pricing 3-hyper graph vertex pricing 8.1-approxmiatoin APX-hard, 2-UGhard Graph vertex pricing 4-approximation 2-UGhardSuper-constant UG- hardness Highway pricingPTAS NP-hardSuper-constant UG- hardness

21

22

23

24

25

26

27

28

29 Passing probability is 1/q.

30

31 Completeness c = q log q.

32

33 Soundness is q.

34  Real valued price function.  NP-hardness reduction  Discount model

35

36

37

38

39 We can not prove the soundness claim for this test.

40

41  Unbalanced price function  Real value price function

42  Lemma 1: The approximability of bipartite graph pricing is equivalent to highway problem on bipartite graph.  Lemma 2: Super-constant hardness of graph pricing also implies super-constant hardness of bipartite graph pricing.

43

44  Given a non-bipartite instance G, we can randomly partition the graph into two parts G’ and only consider the bipartite sub-graph.  We know that for any price function, the profit change by a factor of 2 in expectation.

45  Pricing loss leaders is hard even for the those tractable cases under the positive profit prices model.

46


Download ppt "Yi Wu IBM Almaden Research Joint work with Preyas Popat."

Similar presentations


Ads by Google