Yi Wu IBM Almaden Research Joint work with Preyas Popat.

Slides:



Advertisements
Similar presentations
Truthful Mechanisms for Combinatorial Auctions with Subadditive Bidders Speaker: Shahar Dobzinski Based on joint works with Noam Nisan & Michael Schapira.
Advertisements

On allocations that maximize fairness Uriel Feige Microsoft Research and Weizmann Institute.
6.896: Topics in Algorithmic Game Theory Lecture 21 Yang Cai.
Hardness of Approximating Multicut S. Chawla, R. Krauthgamer, R. Kumar, Y. Rabani, D. Sivakumar (2005) Presented by Adin Rosenberg.
Bart Jansen 1.  Problem definition  Instance: Connected graph G, positive integer k  Question: Is there a spanning tree for G with at least k leaves?
Online Learning for Online Pricing Problems Maria Florina Balcan.
Inapproximability of MAX-CUT Khot,Kindler,Mossel and O ’ Donnell Moshe Ben Nehemia June 05.
Minimum Clique Partition Problem with Constrained Weight for Interval Graphs Jianping Li Department of Mathematics Yunnan University Jointed by M.X. Chen.
Online Mechanism Design (Randomized Rounding on the Fly)
Set Cover 資工碩一 簡裕峰. Set Cover Problem 2.1 (Set Cover) Given a universe U of n elements, a collection of subsets of U, S ={S 1,…,S k }, and a cost.
Approximation Algorithms
On the Density of a Graph and its Blowup Raphael Yuster Joint work with Asaf Shapira.
Lecture 22: April 18 Probabilistic Method. Why Randomness? Probabilistic method: Proving the existence of an object satisfying certain properties without.
Bart Jansen, Utrecht University. 2  Max Leaf  Instance: Connected graph G, positive integer k  Question: Is there a spanning tree for G with at least.
MATCHING WITH COMMITMENTS Joint work with Kevin Costello and Prasad Tetali China Theory Week 2011 Pushkar Tripathi Georgia Institute of Technology.
Bart Jansen, Utrecht University. 2  Max Leaf  Instance: Connected graph G, positive integer k  Question: Is there a spanning tree for G with at least.
4.4 Price Chapter 27.
Maurizio Patrignani seminar on the paper on the single-source unsplittable flow problem authored by Yefim Dinitz Naveen Garg Michel X. Goemans FOCS ‘98.
The Stackelberg Minimum Spanning Tree Game Jean Cardinal · Erik D. Demaine · Samuel Fiorini · Gwenaël Joret · Stefan Langerman · Ilan Newman · OrenWeimann.
Maria-Florina Balcan Approximation Algorithms and Online Mechanisms for Item Pricing Maria-Florina Balcan & Avrim Blum CMU, CSD.
Complexity 16-1 Complexity Andrei Bulatov Non-Approximability.
Yi Wu IBM Almaden Research Joint work with Alina Ene and Jan Vondrak.
Item Pricing for Revenue Maximization in Combinatorial Auctions Maria-Florina Balcan, Carnegie Mellon University Joint with Avrim Blum and Yishay Mansour.
Perfect Graphs Lecture 23: Apr 17. Hard Optimization Problems Independent set Clique Colouring Clique cover Hard to approximate within a factor of coding.
The Theory of NP-Completeness
Approximating complete partitions Guy Kortsarz Joint work with J. Radhakrishnan and S.Sivasubramanian.
Ryan O'Donnell (CMU, IAS) Yi Wu (CMU, IBM) Yuan Zhou (CMU)
A 2-Approximation algorithm for finding an optimum 3-Vertex-Connected Spanning Subgraph.
On The Achromatic Number Problem Guy Kortsarz Rutgers University, Camden.
1 Slides by Asaf Shapira & Michael Lewin & Boaz Klartag & Oded Schwartz. Adapted from things beyond us.
Maria-Florina Balcan Mechanism Design, Machine Learning, and Pricing Problems Maria-Florina Balcan 11/13/2007.
Packing Element-Disjoint Steiner Trees Mohammad R. Salavatipour Department of Computing Science University of Alberta Joint with Joseph Cheriyan Department.
1 Joint work with Shmuel Safra. 2 Motivation 3 Motivation.
Chapter 2 Nonlinear Models Sections 2.1, 2.2, and 2.3.
The Theory of NP-Completeness 1. Nondeterministic algorithms A nondeterminstic algorithm consists of phase 1: guessing phase 2: checking If the checking.
A Fast Algorithm for Enumerating Bipartite Perfect Matchings Takeaki Uno (National Institute of Informatics, JAPAN)
C&O 355 Mathematical Programming Fall 2010 Lecture 19 N. Harvey TexPoint fonts used in EMF. Read the TexPoint manual before you delete this box.: AA A.
Linear Programming Data Structures and Algorithms A.G. Malamos References: Algorithms, 2006, S. Dasgupta, C. H. Papadimitriou, and U. V. Vazirani Introduction.
Edge-disjoint induced subgraphs with given minimum degree Raphael Yuster 2012.
Batch Scheduling of Conflicting Jobs Hadas Shachnai The Technion Based on joint papers with L. Epstein, M. M. Halldórsson and A. Levin.
Restricted Track Assignment with Applications 報告人:林添進.
1 On Completing Latin Squares Iman Hajirasouliha Joint work with Hossein Jowhari, Ravi Kumar, and Ravi Sundaram.
A graph problem: Maximal Independent Set Graph with vertices V = {1,2,…,n} A set S of vertices is independent if no two vertices in S are.
Pricing and Strategies
Maria-Florina Balcan Mechanism Design, Machine Learning and Pricing Problems Maria-Florina Balcan Joint work with Avrim Blum, Jason Hartline, and Yishay.
NP-COMPLETE PROBLEMS. Admin  Two more assignments…  No office hours on tomorrow.
Approximation Algorithms for Graph Homomorphism Problems Chaitanya Swamy University of Waterloo Joint work with Michael Langberg and Yuval Rabani Open.
1/19 Minimizing weighted completion time with precedence constraints Nikhil Bansal (IBM) Subhash Khot (NYU)
Approximate Inference: Decomposition Methods with Applications to Computer Vision Kyomin Jung ( KAIST ) Joint work with Pushmeet Kohli (Microsoft Research)
Non-Approximability Results. Summary -Gap technique -Examples: MINIMUM GRAPH COLORING, MINIMUM TSP, MINIMUM BIN PACKING -The PCP theorem -Application:
The full Steiner tree problem Theoretical Computer Science 306 (2003) C. L. Lu, C. Y. Tang, R. C. T. Lee Reporter: Cheng-Chung Li 2004/06/28.
Dense graphs with a large triangle cover have a large triangle packing Raphael Yuster SIAM DM’10.
Item Pricing for Revenue Maximization in Combinatorial Auctions Maria-Florina Balcan.
“Price” Marketing Tool Pricing Strategies Calculate Price Discounts & Allowances Unit 5.
Combinatorial Auction. A single item auction t 1 =10 t 2 =12 t 3 =7 r 1 =11 r 2 =10 Social-choice function: the winner should be the guy having in mind.
Approximation Algorithms for Combinatorial Auctions with Complement-Free Bidders Speaker: Shahar Dobzinski Joint work with Noam Nisan & Michael Schapira.
Hardness of Hyper-Graph Coloring Irit Dinur NEC Joint work with Oded Regev and Cliff Smyth.
Section 8.1 Systems of Linear Equations; Substitution and Elimination.
TU/e Algorithms (2IL15) – Lecture 12 1 Linear Programming.
The Theory of NP-Completeness
New Characterizations in Turnstile Streams with Applications
5.2 Properties of Parabolas
Analysis and design of algorithm
The Subset Sum Game Revisited
السيولة والربحية أدوات الرقابة المالية الوظيفة المالية
Coverage Approximation Algorithms
Problem Solving 4.
The Byzantine Secretary Problem
Dominating Set By Eric Wengert.
Systems of Linear Equations; Substitution and Elimination
Presentation transcript:

Yi Wu IBM Almaden Research Joint work with Preyas Popat

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?

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

Profit is 40.

Profit is 50. Loss leader

 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

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

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

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

 [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.”

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

Passing probability is 1/q.

Completeness c = q log q.

Soundness is q.

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

We can not prove the soundness claim for this test.

 Unbalanced price function  Real value price function

 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.

 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.

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