Problem(Finding Simple Competitive Price): Given a set of existing hotels and a new hotel h what greatest possible price can we set for h such that h is in the skyline? Problem(Finding K-Dominating Competitive Price): Given a set of existing hotels, a new hotel hf and an integer K what greatest possible price can we set for h such that (1)h is in the skyline Conside and(2)hf dominates at least K hotels ToteS H=th1, h2, h3, ha], hk A={a1} at an-site(e.g, Sea World) Spatial layout Finding K-Dominating Competitive price is more general than Finding simple In order to make sure thal Competitive price Price() customers with a higher probability we would like to set the price of hf such that 3.0 1. h is in the skyline 1.0 250 2. h dominates at least K hotels where K is a 4.0 200 user parameter. 2.5 220 ? 2.0 210 h dominates one hotel ( i.e. h4) $210 is a 1-dominating competitive price
1. Introduction Hotel Price ($) h1 100 h2 250 h3 200 h4 220 11 H = {h1 , h2 , h3 , h4} A = {a1} hotels attraction-site (e.g., Sea World) h4 a1 h2 h3 h1 Spatial Layout Price Hotel Distance-toSeaWorld (km) Price ($) h1 3.0 100 h2 1.0 250 h3 4.0 200 h4 2.5 220 Decision-Making Table Consider that a new company wants to open a new hotel hf hf , hf} hf ? hf 2.0 ? 230 hf dominates one hotel (i.e., h4 ). In order to make sure that hf is chosen by customers with a higher probability, we would like to set the price of hf such that 1. hf is in the skyline 2. hf dominates at least K hotels where K is a user parameter. 210 $210 is a 1-dominating competitive price. Problem (Finding K-Dominating Competitive Price): Given a set of existing hotels, a new hotel hf and an integer K, what greatest possible price can we set for hf such that (1) hf is in the skyline and (2) hf dominates at least K hotels. Finding K-Dominating Competitive Price is more general than Finding Simple Competitive Price. Problem (Finding Simple Competitive Price): Given a set of existing hotels and a new hotel hf , what greatest possible price can we set for hf such that hf is in the skyline?
1 Introduction In this paper, we study the problem of finding K-dominating competitive pric ce a Contributions First to study this problem Most existing studies focus on how to find hotels in the skyline when the prices of the hotels are given. Propose an algorithm based on spatial properties
1. Introduction ◼ In this paper, we study the problem of “finding K-dominating competitive price” ◼ Contributions: ◼ First to study this problem ◼ Most existing studies focus on how to find hotels in the skyline when the prices of the hotels are given. ◼ Propose an algorithm based on spatial properties 12
Outline 1. Introduction 2 Problem definition 3. Algorithm Spatial approach 4. Discussion 5. Empirical Study 6. Related work 7. Conclusion 13
Outline 1. Introduction 2. Problem Definition 3. Algorithm ◼ Spatial Approach 4. Discussion 5. Empirical Study 6. Related Work 7. Conclusion 13
Problem(Finding K-Dominating Competitive Price) Given a set of existing hotels, a new hotel hf and an integer K what greatest possible price can we set for h such that(1) h is in the skyline and(2)h dominates at least k hotels Consider that a nev k-dominating requirement tel Skyline requirement hotels 1r12 A=a1, a2, a33 a can contain more than one attraction -site Spatial layout Price Decision-Making table Hotel dista dista distance rice($) Hotel Prices) to a, to a to a 100 hr 250 250 200 h 200 220 220 ?
1. Introduction Hotel Price ($) h1 100 h2 250 h3 200 h4 220 14 H = {h1 , h2 , h3 , h4} A = {a1} hotels attraction-site (e.g., Sea World) h4 a1 h2 h3 h1 Spatial Layout Price Hotel Distance-toSeaWorld (km) Price ($) h1 3.0 100 h2 1.0 250 h3 4.0 200 h4 2.5 220 Decision-Making Table Consider that a new company wants to open a new hotel hf hf , hf} hf ? hf 2.0 ? {a1 , a2 , a3} A can contain more than one attraction-site a2 a3 Problem (Finding K-Dominating Competitive Price): Given a set of existing hotels, a new hotel hf and an integer K, what greatest possible price can we set for hf such that (1) hf is in the skyline and (2) hf dominates at least K hotels. K-dominating requirement Skyline requirement distance to a1 … … … … … distance to a2 … … … … … distance to a3 … … … … …
Outline 1. Introduction 2. Problem definition 3. Algorithm Spatial Approach 4. Discussion 5. Empirical Study 6. Related work 7. Conclusion 15
Outline 1. Introduction 2. Problem Definition 3. Algorithm ◼ Spatial Approach 4. Discussion 5. Empirical Study 6. Related Work 7. Conclusion 15