Price Differentiation for Communication Networks Shuqin (Helen) Li and Jianwei Huang, IEEE Transactions on Networking, Forthcoming.

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

Delay Analysis and Optimality of Scheduling Policies for Multihop Wireless Networks Gagan Raj Gupta Post-Doctoral Research Associate with the Parallel.
Hadi Goudarzi and Massoud Pedram
PAUL.S.CALEM DANIEL.F.SPULBER.   This paper examines two part pricing by a multiproduct monopoly and a differentiated oligopoly.  Two part pricing.
Seminar in Auctions and Mechanism Design Based on J. Hartline’s book: Approximation in Economic Design Presented by: Miki Dimenshtein & Noga Levy.
A Prior-Free Revenue Maximizing Auction for Secondary Spectrum Access Ajay Gopinathan and Zongpeng Li IEEE INFOCOM 2011, Shanghai, China.
Preference Elicitation Partial-revelation VCG mechanism for Combinatorial Auctions and Eliciting Non-price Preferences in Combinatorial Auctions.
Seminar In Game Theory Algorithms, TAU, Agenda  Introduction  Computational Complexity  Incentive Compatible Mechanism  LP Relaxation & Walrasian.
Bundling Equilibrium in Combinatorial Auctions Written by: Presented by: Ron Holzman Rica Gonen Noa Kfir-Dahav Dov Monderer Moshe Tennenholtz.
Nan Cheng Smart Grid & VANETs Joint Group Meeting Economics of Electric Vehicle Charging - A Game Theoretic Approach IEEE Trans. on Smart Grid,
A SLA Framework for QoS Provisioning and Dynamic Capacity Allocation Rahul Garg (IBM India Research Lab), R. S. Randhawa (Stanford University), Huzur Saran.
Extended Baum-Welch algorithm Present by shih-hung Liu
The Stackelberg Minimum Spanning Tree Game Jean Cardinal · Erik D. Demaine · Samuel Fiorini · Gwenaël Joret · Stefan Langerman · Ilan Newman · OrenWeimann.
Achieving Network Optima Using Stackelberg Routing Strategies Yannis A. Korilis, Member, IEEE Aurel A. Lazar, Fellow, IEEE & Ariel Orda, Member IEEE IEEE/ACM.
CAC for Multimedia Services in Mobile Cellular Networks : A Markov Decision Approach Speaker : Xu Jia-Hao Advisor : Ke Kai-Wei Date : 2004 / 11 / 18.
Dynamic Spectrum Management: Optimization, game and equilibrium Tom Luo (Yinyu Ye) December 18, WINE 2008.
Multicast Networks Profit Maximization and Strategyproofness David Kitchin, Amitabh Sinha Shuchi Chawla, Uday Rajan, Ramamoorthi Ravi ALADDIN Carnegie.
Product Variety and Quality under monopoly
Base Station Association Game in Multi-cell Wireless Network Libin Jiang, Shyam Parekh, Jean Walrand.
A Scalable Network Resource Allocation Mechanism With Bounded Efficiency Loss IEEE Journal on Selected Areas in Communications, 2006 Johari, R., Tsitsiklis,
1 Auction or Tâtonnement – Finding Congestion Prices for Adaptive Applications Xin Wang Henning Schulzrinne Columbia University.
-1- Entrance of Cable TV Service Provider into Broadband Internet Service Market : Service Bundling and Role of Access Charge By Jae-Hyeon Ahn, Jungsuk.
Scheduling for Wireless Networks with Users’ Satisfaction and Revenue Management Leonardo Badia*, Michele Zorzi + Speaker: Andrea Zanella + {lbadia,
Competitive Analysis of Incentive Compatible On-Line Auctions Ron Lavi and Noam Nisan SISL/IST, Cal-Tech Hebrew University.
Online Auctions in IaaS Clouds: Welfare and Profit Maximization with Server Costs Xiaoxi Zhang 1, Zhiyi Huang 1, Chuan Wu 1, Zongpeng Li 2, Francis C.M.
Efficient agent-based selection of DiffServ SLAs over MPLS networks Thanasis G. Papaioannou a,b, Stelios Sartzetakis a, and George D. Stamoulis a,b presented.
Course outline I Homogeneous goods Introduction Game theory
Max-flow/min-cut theorem Theorem: For each network with one source and one sink, the maximum flow from the source to the destination is equal to the minimal.
Equilibrium problems with equilibrium constraints: A new modelling paradigm for revenue management Houyuan Jiang Danny Ralph Stefan Scholtes The Judge.
A prefix-based approach for managing hybrid specifications in complex packet filtering Author: Nizar Ben Neji, Adel Bouhoula Publisher: Computer Networks.
By: Gang Zhou Computer Science Department University of Virginia 1 A Game-Theoretic Framework for Congestion Control in General Topology Networks SYS793.
Primal-Dual Meets Local Search: Approximating MST’s with Non-uniform Degree Bounds Author: Jochen Könemann R. Ravi From CMU CS 3150 Presentation by Dan.
1 IEEE Trans. on Smart Grid, 3(1), pp , Optimal Power Allocation Under Communication Network Externalities --M.G. Kallitsis, G. Michailidis.
Optimization for Operation of Power Systems with Performance Guarantee
An Online Auction Framework for Dynamic Resource Provisioning in Cloud Computing Weijie Shi*, Linquan Zhang +, Chuan Wu*, Zongpeng Li +, Francis C.M. Lau*
1 Power control under best response dynamics for interference mitigation in a two-tier femtocell network Vaggelis G. Douros Stavros.
1 [3] Jorge Martinez-Bauset, David Garcia-Roger, M a Jose Domenech- Benlloch and Vicent Pla, “ Maximizing the capacity of mobile cellular networks with.
Utilizing Call Admission Control for Pricing Optimization of Multiple Service Classes in Wireless Cellular Networks Authors : Okan Yilmaz, Ing-Ray Chen.
On a Production/Inventory System with Strategic Customers and Unobservable Inventory Levels Can Oz Fikri Karaesmen SMMSO June 2015.
Strategyproof Auctions For Balancing Social Welfare and Fairness in Secondary Spectrum Markets Ajay Gopinathan, Zongpeng Li University of Calgary Chuan.
LECTURE 13. Course: “Design of Systems: Structural Approach” Dept. “Communication Networks &Systems”, Faculty of Radioengineering & Cybernetics Moscow.
Integration of WiMAX and WiFi Optimal Pricing for Bandwidth Sharing Dusit Niyato and Ekram Hossain, TRLabs and University of Manitoba IEEE Communications.
Congestion Control in CSMA-Based Networks with Inconsistent Channel State V. Gambiroza and E. Knightly Rice Networks Group
Competitive Queue Policies for Differentiated Services Seminar in Packet Networks1 Competitive Queue Policies for Differentiated Services William.
Energy-Efficient Sensor Network Design Subject to Complete Coverage and Discrimination Constraints Frank Y. S. Lin, P. L. Chiu IM, NTU SECON 2005 Presenter:
Com & Net Call admission control (JABA-SD = MBA-SD) May 14, 2002 김 영 덕.
Linear Programming Erasmus Mobility Program (24Apr2012) Pollack Mihály Engineering Faculty (PMMK) University of Pécs João Miranda
Capacity Enhancement with Relay Station Placement in Wireless Cooperative Networks Bin Lin1, Mehri Mehrjoo, Pin-Han Ho, Liang-Liang Xie and Xuemin (Sherman)
Pasternack1 Optimal Pricing and Return Policies for Perishable Commodities B. A. Pasternack Presenter: Gökhan METAN.
Pricing with Markups in Competitive Markets with Congestion Nicolás Stier-Moses, Columbia Business School Joint work with José Correa, Universidad Adolfo.
Information Theory for Mobile Ad-Hoc Networks (ITMANET): The FLoWS Project Competitive Scheduling in Wireless Networks with Correlated Channel State Ozan.
© 2010 Institute of Information Management National Chiao Tung University Chapter 9 Markets for Differentiated Product Market for Two Differentiated Products.
An Optimal Distributed Call Admission control for Adaptive Multimedia in Wireless/Mobile Networks Reporter: 電機所 鄭志川.
Channel Coordination and Quantity Discounts Z. Kevin Weng Presented by Jing Zhou.
OR Chapter 8. General LP Problems Converting other forms to general LP problem : min c’x  - max (-c)’x   = by adding a nonnegative slack variable.
Minimizing Delay in Shared Pipelines Ori Rottenstreich (Technion, Israel) Joint work with Isaac Keslassy (Technion, Israel) Yoram Revah, Aviran Kadosh.
Efficient Resource Allocation for Wireless Multicast De-Nian Yang, Member, IEEE Ming-Syan Chen, Fellow, IEEE IEEE Transactions on Mobile Computing, April.
An extension to Salop’s model Focused on variety differentiation: consumers differ on the most preferred variety Expands it to include quality differentiation:
Chance Constrained Robust Energy Efficiency in Cognitive Radio Networks with Channel Uncertainty Yongjun Xu and Xiaohui Zhao College of Communication Engineering,
Quick summary One-dimensional vertical (quality) differentiation model is extended to two dimensions Use to analyze product and price competition Two.
Common Intersection of Half-Planes in R 2 2 PROBLEM (Common Intersection of half- planes in R 2 ) Given n half-planes H 1, H 2,..., H n in R 2 compute.
Parametric Quadratic Optimization Oleksandr Romanko Joint work with Alireza Ghaffari Hadigheh and Tamás Terlaky McMaster University January 19, 2004.
Courtesy Piggybacking: Supporting Differentiated Services in Multihop Mobile Ad Hoc Networks Wei LiuXiang Chen Yuguang Fang WING Dept. of ECE University.
Revenue Sharing among ISPs in Two-Sided Markets Yuan Wu, Hongseok Kim, Prashanth H. Hande, Muan Chiang, Danny H.K. Tsang Published at IEEE Infocom 2011.
1 Chapter 6 Reformulation-Linearization Technique and Applications.
1 Chapter 5 Branch-and-bound Framework and Its Applications.
Near-Optimal Spectrum Allocation for Cognitive Radios: A Frequency-Time Auction Perspective Xinyu Wang Department of Electronic Engineering Shanghai.
Extended Baum-Welch algorithm
Cross layer design is wireless multi-hop network
Effective Social Network Quarantine with Minimal Isolation Costs
Presentation transcript:

Price Differentiation for Communication Networks Shuqin (Helen) Li and Jianwei Huang, IEEE Transactions on Networking, Forthcoming

Revenue Management for Communication Networks 2 Authors Shuqin (Helen) Li PhD from CUHK, 2012 Now at Shanghai Bell Labs

Revenue Management for Communication Networks 3 Revenue Management for Comm. Networks Revenue management: how to (set the prices to) maximize the revenue? Service Provider Revenue management: to sell the right resources to the right customers at the right time and the right price. Revenue management: to sell the right resources to the right customers at the right time and the right price. Heterogeneity of users, technologies, applications…

Revenue Management for Communication Networks 4 Outline Introduction Network Model Complete Price Differentiation Single Price Scheme (No Differentiation) Partial Price Differentiation Conclusion

Revenue Management for Communication Networks 5 Network Model A Service provider S : total resource (N 1, n 1, u 1, s 1, p 1 ) (N 2, n 2, u 2, s 2, p 2 ) (N 3, n 3, u 3, s 3, p 3 ) N 2 = 3n 2 = 2 Utility: u 2 (s 2 ) =θ 2 log(1+ s 2 ) Surplus: u 2 (s 2 ) – p 2 s 2 Admitted to access One SP S: Total limited resource I groups of users Indexed by i=1,2,…I For group i: N i homogeneous users n i : admitted users u i (s i )=θ i log(1+s i ) : Utility function s i : allocated resource θ i :willingness to pay p i : Price per unit resource of group i Assume θ 1 >θ 2 >…>θ I

Revenue Management for Communication Networks 6 Two-stage System Model Two-stage System model (Stackelberg Game) Consider the incentives of both SP and users Stage 1: SP sets the price Stage 2: an admitted user Chooses the quantity s i Stage 2: an admitted user Chooses the quantity s i determine (p i,n i ) Complete information? Complete information? Yes No, Design a price menu SP must guarantee Complete price differentiation Single price scheme Partial price differentiation revenue complexity

Revenue Management for Communication Networks 7 Outline Introduction Network Model Complete Price Differentiation Single Price Scheme (No Differentiation) Partial Price Differentiation Conclusion

8 Revenue Management for Communication Networks A group i user admitted in stage 1 given price p i maximize his surplus by choosing the proper resource quantity: Complete Information: Stage 2 Stage 1: SP sets the price Stage 2: an admitted user Chooses the quantity s i Stage 2: an admitted user Chooses the quantity s i (p i,n i ) Complete information? Complete information? Yes

Revenue Management for Communication Networks 9 Complete Price Differentiation SP’s pricing and admission control problem: Difficulties: Non-convex objective Integer variables Coupled constraint Method: decomposition Resource allocation subproblem Admission control subproblem Stage 1: SP sets the price Stage 2: an admitted user Chooses the quantity s i Stage 2: an admitted user Chooses the quantity s i (p i,n i ) Complete information? Complete information? Yes

10 Revenue Management for Communication Networks Complete Price Differentiation (con’t) Solution All users are admitted There exist a group threshold K cp and λ *, such that Intuition Nonzero resourceZero resource group1group2group6group5group4group3 K cp =4 Effective market Prices are too high to deman any resource Prices can perform admission control Threshold structure Group i K cp =4 Total resource S Indicates to allocate resource to high willingness to pay users with priority θ 1 >θ 2 >…>θ I

Revenue Management for Communication Networks 11 Outline Introduction Network Model Complete Price Differentiation Single Price Scheme (No Differentiation) Partial Price Differentiation Conclusion

12 Revenue Management for Communication Networks Single Price Scheme (No differentiation) SP charges a single price to all groups Solution All users are admitted There exist a group threshold K sp and p *, such that Remark: Similar threshold structure as the complete price differention

Revenue Management for Communication Networks 13 Special Properties of Single Price Scheme A smaller effective market : The effective market can be equivalent to a “Super-group” where Under single price scheme: Nonzero resourceZero resource group6group5 K sp =4 group1group2group4group3 Effective market Super-group

Revenue Management for Communication Networks 14 When is price differentiation most beneficial? High differentiation gain: – High willingness to pay users are minorities – Resource are comparativelly limited A three-group example But what if the number of user type is large… θ1θ1 N1N1 θ2θ2 N2N2 θ3θ3 N3N3 θ Case Case Case Peak points indicate the chages of effective market under the single price shceme revenue complexity

Revenue Management for Communication Networks 15 Outline Introduction Network Model Complete Price Differentiation Single Price Scheme (No Differentiation) Partial Price Differentiation Conclusion

Revenue Management for Communication Networks 16 Partial Price Differentiation SP charges J( ≤ I) prices to I groups group6group5group1group2group4group3 Ex: Charge 6 groups with 2 prices p1p1 p2p2 =p 1 =p 2 =p 3 =p 4 =p 5 =p 6 General formulation: General formulation: Including CP (J=I) and SP (J=1) as special cases Difficulties: Difficulties: Combinatorial optimization problem groupsI=10I=100I=1000 S(I, J) * * * Partition I groups into J clusters: S(I, J)

Revenue Management for Communication Networks 17 Solving Parital Price Differentiation First: reduce search space consecutive group indices – Optimal partitions involve consecutive group indices within clusters – Intuition: high willingness to pay groups have priority Transfer into three (nested) sub-problems – Optimal partition into clusters – In each cluster: single pricing problem – Among clusters: complete price differentiation problem Polynomial time (O(I J ) ) algorithm group5group1group2group4group3 0 K pp =4 group6 group2group1group3group5group4 0 group6 groupsI=10I=100I=1000 S(I, J) * * * C(I-1, J-1)

Revenue Management for Communication Networks 18 Trade-off: Complexity Vs. Revenue Partition price differentiation : a five-group example Group i θiθi NiNi Note: High willingness to pay users are minorities When S=100 Gain Two-price14.9% Three-price16.5% Four-price17.1% Five-price17.3%

Revenue Management for Communication Networks 19 Conclusion Stage 1: SP sets the price Stage 2: an admitted user Chooses the quantity s i Stage 2: an admitted user Chooses the quantity s i (p i,n i ) Complete information? Complete information? Yes No, statistical information only SP must guarantee revenue complexity Complete price differentiation Single price scheme Partial price differentiation

Revenue Management for Communication Networks 20 Q & A

Revenue Management for Communication Networks 21 CP under Incomplete Information Incomplete Information Challenge: Possible to realize price differentiation? Method: Make the users self-differentiate SP: publishes the quantity-based price menu. Users: freely choose their quantities. Stage 1: SP sets the price Stage 2: an admitted user Chooses the quantity s i Stage 2: an admitted user Chooses the quantity s i (p i,n i ) Complete information? Complete information? Yes No, statistical information only SP must guarantee I: the total number of groups N i s: the number of users in each group u i s: the utility function of each group But The SP doesn’t know which group each user belongs to. The higher the quantity, the higher the price.

Revenue Management for Communication Networks 22 CP under Incomplete Information (con’t) Aim: to properly set the thresholds to make the users self-differentiated to get the same result just as the complete price differentiation scheme. CP: θ 1 > θ 2, s 1 * >s 2 *, p 1 * >p 2 * θ 1 log(1+s 1 )-p 2 * s 1 θ 1 log(1+s 1 )-p 1 * s 1 High price p 1 * Low price p 2 * √ Consider two-group case: group 1 chooses higher price p 1 * at quantity s 1 * group 2 chooses lower price p 2 * at quantity s 2 *

Revenue Management for Communication Networks 23 CP under Incomplete Information Complete Price differentiation can be reached when the following condition is satisfied: for q=1,…K cp -1 Similar result may be extended to partial price differentiation

Revenue Management for Communication Networks 24 Outline Introduction Model Revenue maximization under Complete Information – Complete Price Differentiation – Single Price Scheme (No Differentiation) – Partial Price Differentiation Revenue maximization under Incomplete Information – Differentiation Schemes Conclusion

Revenue Management for Communication Networks 25 When is price differentiation most benifical? Differentiation Gain – Consider a simple two-group case: where Ratio of willingness to pays total number of the users the percentage of group 1 users (high willingness to pay users) the level of normalized available resource

26 Revenue Management for Communication Networks Differentiation Gain in a Two-group Cases Fix α and k, for parameter t (1) K sp =2, K cp =2 (2) K sp =1, K cp =2 (3) K sp =1, K cp =1 (CD degenerates to SP) Define Differentiation gain is large when: α is small → high willingness to pay users are minorities k is small → resource is limited

Revenue Management for Communication Networks 27 CP under Incomplete Information Complete Price differentiation can be reached when the following condition is satisfied: for q=1,…K cp -1 where t q is the unique solution of over the domain t >1. Corollary: – t q is upper bounded by t q <t root ≈ , for q=1,…K-1, – t root is the root of the equation Similar result can be extended to partial price differentiation