Luyi Yang

Luyi Yang

Auto-generated profile, based on publicly available information

Luyi Yang

Haas School of Business, University of California, Berkeley, Berkeley, California 94720

Research Focus & Metrics

Academic Career Length

10Years (2017-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 July 2017 in Management Science
Verified
Journal Article
Closed access
LYLuyi Yang
Luyi Yang
LDLaurens Debo
Laurens Debo
VGVarun Gupta
Varun Gupta
The first in, first out (FIFO) queue discipline respects the order of arrivals, but is not efficient when customers have heterogeneous waiting costs. Priority queues, in which customers with higher waiting costs are served first, are more efficient but usually involve undesirable queue-jumping behaviors that violate bumped customers’ property rights over their waiting spots. To have the best of both worlds, we propose time-trading mechanisms, in which customers who are privately informed about their waiting costs mutually agree on the ordering in the queue by trading positions. If a customer ever moves back in the queue, she will receive an appropriate monetary compensation. Customers can always decide not to participate in trading and retain their positions as if they are being served FIFO. We design the optimal mechanisms for the social planner, the service provider, and an intermediary who might mediate the trading platform. Both the social planner’s and the service provider’s optimal mechanisms involve a flat admission fee and an auction that implements strict priority. If a revenue-maximizing intermediary operates the trading platform, it should charge a trade participation fee and implement an auction with some trade restrictions. Therefore, customers are not strictly prioritized. However, relative to a FIFO system, the intermediary delivers value to the social planner by improving efficiency, and to the service provider by increasing its revenue. This paper was accepted by Noah Gans, stochastic models and simulation.

1 January 2020 in Management Science
Verified
Journal Article
Closed access
SCShiliang Cui
Shiliang Cui
ZWZhongbin Wang
Zhongbin Wang
LYLuyi Yang
Luyi Yang
This paper studies an emerging business model of line-sitting in which customers seeking service can hire others (line-sitters) to wait in line on behalf of them. We develop a queueing-game-theoretic model that captures the interaction among customers, the line-sitting firm, and the service provider to examine the impact of line-sitting on the service provider’s revenue and customer welfare. We also contrast line-sitting with the well-known priority purchasing scheme, as both allow customers to pay extra to skip the wait. Our main results are as follows. First, we find that both accommodating line-sitting and selling priority can bring in extra revenue for the service provider, although by different means—selling priority increases revenue mainly by allowing the service provider to practice price discrimination that extracts more customer surplus, whereas line-sitting does so through demand expansion, attracting customers who would not otherwise join. Second, the priority purchasing scheme tends to make the customer population worse off, whereas line-sitting can be a win–win proposition for both the service provider and the customers. Nevertheless, having the additional option of hiring line-sitters does not always benefit customers as a whole because the demand expansion effect also induces negative congestion externalities. Finally, despite the fact that the service provider collects the priority payment as revenue but not the line-sitting payment, which accrues to the third-party line-sitting firm, we demonstrate that, somewhat surprisingly, accommodating line-sitting can raise more revenue for the service provider than directly selling priority. This paper was accepted by Charles Corbett, operations management.

1 February 2023 in Management Science
Verified
Journal Article
Closed access
CJChen Jin
Chen Jin
LYLuyi Yang
Luyi Yang
CZCungen Zhu
Cungen Zhu
The “right-to-repair” (RTR) movement calls for government legislation that requires manufacturers to provide repair information, tools, and parts so that consumers can independently repair their own products with more ease. The initiative has gained global traction in recent years. Repair advocates argue that such legislation would break manufacturers’ monopoly on the repair market and benefit consumers. They further contend that it would reduce the environmental impact by reducing e-waste and new production. Yet the RTR legislation may also trigger a price response in the product market as manufacturers try to mitigate the profit loss. This paper employs an analytical model to study the pricing, welfare, and environmental implications of RTR. We find that, as the RTR legislation continually lowers the independent repair cost, manufacturers may initially cut the new product price and then raise it. This nonmonotone price adjustment may further induce a nonmonotone change in consumer surplus, social welfare, and the environmental impact. Strikingly, the RTR legislation can potentially lead to a lose–lose–lose outcome that compromises manufacturer profit, reduces consumer surplus, and increases the environmental impact despite repair being made easier and more affordable. This paper was accepted by Charles Corbett, operations management. Funding: Chen Jin gratefully acknowledges the Singapore Ministry of Education Academic Research Fund [Tier 1, Grant R-253-000-144-133]. Supplemental Material: The online appendix is available at https://doi.org/10.1287/mnsc.2022.4401 .

1 June 2023 in Information Systems Research
Verified
Journal Article
Closed access
CJChen Jin
Chen Jin
LYLuyi Yang
Luyi Yang
KHKartik Hosanagar
Kartik Hosanagar
Brushing—online merchants placing fake orders of their own products—has been a widespread phenomenon on major e-commerce platforms. One key reason why merchants brush is that it boosts their rankings in search results. Products with higher sales volume are more likely to rank higher. Additionally, rankings matter because consumers face search frictions and narrow their attention to only the few products that show up at the top. Thus, fake orders can affect consumer choice. In our paper, we find that if brushing gets more costly for merchants (e.g., due to stricter platform policies), it may sometimes surprisingly harm consumers as it may only blunt brushing by the merchant who sells a more popular product but intensify brushing by the merchant selling a less popular product. If search is less costly for consumers (e.g., due to improved search technologies), it may not always benefit consumers, either. Moreover, the design of the ranking algorithm is critical: placing more weight on sales-volume-related factors may trigger a nonmonotone change in consumer welfare; tracking recent sales only as opposed to cumulative sales does not always dial down brushing and, in fact, may sometimes cause the merchant selling a less popular product to brush more.

1 November 2021 in Management Science
Verified
Journal Article
Closed access
LYLuyi Yang
Luyi Yang
ZWZhongbin Wang
Zhongbin Wang
SCShiliang Cui
Shiliang Cui
Recent years have witnessed the rise of queue scalping in congestion-prone service systems. A queue scalper has no material interest in the primary service but proactively enters the queue in hopes of selling his spot later. This paper develops a queueing-game-theoretic model of queue scalping and generates the following insights. First, we find that queues with either a very small or very large demand volume may be immune to scalping, whereas queues with a nonextreme demand volume may attract the most scalpers. Second, in the short run, when capacity is fixed, the presence of queue scalping often increases social welfare and can increase or reduce system throughput, but it tends to reduce consumer surplus. Third, in the long run, the presence of queue scalping motivates a welfare-maximizing service provider to adjust capacity using a “pull-to-center” rule, increasing (respectively, reducing) capacity if the original capacity level is low (respectively, high). When the service provider responds by expanding capacity, the presence of queue scalping can increase social welfare, system throughput, and even consumer surplus in the long run, reversing its short-run detrimental effect on customers. Despite these potential benefits, such capacity expansion does little to mitigate scalping and may only generate more scalpers in the queue. Finally, we compare and contrast queue scalping with other common mechanisms in practice—namely, (centralized) pay-for-priority, line sitting, and callbacks. This paper was accepted by Victor Martínez de Albéniz, operations management.

1 May 2023 in Operations Research
Verified
Journal Article
Closed access
ZWZhongbin Wang
Zhongbin Wang
LYLuyi Yang
Luyi Yang
SCShiliang Cui
Shiliang Cui
SÜSezer Ülkü
Sezer Ülkü
YZYong-Pin Zhou
Yong-Pin Zhou
To Pool or Not to Pool? Analyzing Customer-Intensive Services with Strategic Agents In customer-intensive services where service quality increases with service time, service providers commonly pool their agents and give performance bonuses that reward agents for achieving greater customer satisfaction and serving more customers. Conventional wisdom suggests that pooling agents reduce customer wait time whereas performance bonuses motivate agents to produce high-quality services, both of which should boost customer satisfaction. However, in “Pooling Agents for Customer-Intensive Services,” Wang, Yang, Cui, Ülkü, and Zhou find that when agents act strategically, they may choose to speed up under pooling in an attempt to serve more customers, thus undermining service quality. If this happens, pooling can backfire and result in both lower customer satisfaction and agent payoff. Consequently, the researchers propose a simple practical solution to restore the efficiency of pooling. They propose pooling a portion of the performance bonuses (incentive pooling) in conjunction with pooling agents (operational pooling).