ترغب بنشر مسار تعليمي؟ اضغط هنا

Optimal Pricing in Networks with Externalities

119   0   0.0 ( 0 )
 نشر من قبل Ozan Candogan
 تاريخ النشر 2011
  مجال البحث الهندسة المعلوماتية
والبحث باللغة English




اسأل ChatGPT حول البحث

We study the optimal pricing strategies of a monopolist selling a divisible good (service) to consumers that are embedded in a social network. A key feature of our model is that consumers experience a (positive) local network effect. In particular, each consumers usage level depends directly on the usage of her neighbors in the social network structure. Thus, the monopolists optimal pricing strategy may involve offering discounts to certain agents, who have a central position in the underlying network. First, we consider a setting where the monopolist can offer individualized prices and derive an explicit characterization of the optimal price for each consumer as a function of her network position. In particular, we show that it is optimal for the monopolist to charge each agent a price that is proportional to her Bonacich centrality in the social network. In the second part of the paper, we discuss the optimal strategy of a monopolist that can only choose a single uniform price for the good and derive an algorithm polynomial in the number of agents to compute such a price. Thirdly, we assume that the monopolist can offer the good in two prices, full and discounted, and study the problem of determining which set of consumers should be given the discount. We show that the problem is NP-hard, however we provide an explicit characterization of the set of agents that should be offered the discounted price. Next, we describe an approximation algorithm for finding the optimal set of agents. We show that if the profit is nonnegative under any feasible price allocation, the algorithm guarantees at least 88% of the optimal profit. Finally, we highlight the value of network information by comparing the profits of a monopolist that does not take into account the network effects when choosing her pricing policy to those of a monopolist that uses this information optimally.



قيم البحث

اقرأ أيضاً

A decision-maker is deciding between an active action (e.g., purchase a house, invest certain stock) and a passive action. The payoff of the active action depends on the buyers private type and also an unknown state of nature. An information seller c an design experiments to reveal information about the realized state to the decision-maker and would like to maximize profit from selling such information. We fully characterize, in closed-form, the revenue-optimal information selling mechanism for the seller. After eliciting the buyers type, the optimal mechanism charges the buyer an upfront payment and then simply reveals whether the realized state passed a certain threshold or not. The optimal mechanism features both price discrimination and information discrimination. The special buyer type who is a priori indifferent between the active and passive action benefits the most from participating in the mechanism.
129 - Cuilian Li 2008
Cooperative multihop communication can greatly increase network throughput, yet packet forwarding for other nodes involves opportunity and energy cost for relays. Thus one of the pre-requisite problems in the successful implementation of multihop tra nsmission is how to foster cooperation among selfish nodes. Existing researches mainly adopt monetary stimulating. In this manuscript, we propose instead a simple and self-enforcing forwarding incentive scheme free of indirect monetary remunerating for asymmetric (uplink multihop, downlink single-hop) cellar network based on coalitional game theory, which comprises double compensation, namely, Inter- BEA, global stimulating policy allotting resources among relaying coalitions according to group size, and Intra-BEA, local compensating and allocating rule within coalitions. Firstly, given the global allotting policy, we introduce a fair allocation estimating approach which includes remunerating for relaying cost using Myerson value for partition function game, to enlighten the design of local allocating rules. Secondly, given the inter- and intra-BEA relay fostering approach, we check stability of coalition structures in terms of internal and external stability as well as inductive core. Theoretic analysis and numerical simulation show that our measure can provide communication opportunities for outer ring nodes and enlarge system coverage, while at the same time provide enough motivation with respect to resource allocation and energy saving for nodes in inner and middle ring to relay for own profits.
A patient seller aims to sell a good to an impatient buyer (i.e., one who discounts utility over time). The buyer will remain in the market for a period of time $T$, and her private value is drawn from a publicly known distribution. What is the reven ue-optimal pricing-curve (sequence of (price, time) pairs) for the seller? Is randomization of help here? Is the revenue-optimal pricing-curve computable in polynomial time? We answer these questions in this paper. We give an efficient algorithm for computing the revenue-optimal pricing curve. We show that pricing curves, that post a price at each point of time and let the buyer pick her utility maximizing time to buy, are revenue-optimal among a much broader class of sequential lottery mechanisms: namely, mechanisms that allow the seller to post a menu of lotteries at each point of time cannot get any higher revenue than pricing curves. We also show that the even broader class of mechanisms that allow the menu of lotteries to be adaptively set, can earn strictly higher revenue than that of pricing curves, and the revenue gap can be as big as the support size of the buyers value distribution.
We consider the problem of posting prices for unit-demand buyers if all $n$ buyers have identically distributed valuations drawn from a distribution with monotone hazard rate. We show that even with multiple items asymptotically optimal welfare can b e guaranteed. Our main results apply to the case that either a buyers value for different items are independent or that they are perfectly correlated. We give mechanisms using dynamic prices that obtain a $1 - Theta left( frac{1}{log n}right)$-fraction of the optimal social welfare in expectation. Furthermore, we devise mechanisms that only use static item prices and are $1 - Theta left( frac{logloglog n}{log n}right)$-competitive compared to the optimal social welfare. As we show, both guarantees are asymptotically optimal, even for a single item and exponential distributions.
Sponsored Search Auctions (SSAs) arguably represent the problem at the intersection of computer science and economics with the deepest applications in real life. Within the realm of SSAs, the study of the effects that showing one ad has on the other ads, a.k.a. externalities in economics, is of utmost importance and has so far attracted the attention of much research. However, even the basic question of modeling the problem has so far escaped a definitive answer. The popular cascade model is arguably too idealized to really describe the phenomenon yet it allows a good comprehension of the problem. Other models, instead, describe the setting more adequately but are too complex to permit a satisfactory theoretical analysis. In this work, we attempt to get the best of both approaches: firstly, we define a number of general mathematical formulations for the problem in the attempt to have a rich description of externalities in SSAs and, secondly, prove a host of results drawing a nearly complete picture about the computational complexity of the problem. We complement these approximability results with some considerations about mechanism design in our context.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا