关键词: 拍卖机制设计, 资源分配, 价格算法, 共享经济, 关键路径

Abstract: The sharing economy has brought great changes to people??s lifestyle, but most of the reservation modes allocate resources by the method of fixed price and first-come-first-serve. This results in low profits of suppliers and low utilization of resources. Based on this, this paper proposes a mechanism based on auction, RAUPAM (resources allocation and user payment approximation mechanism), which is applicable to any sharing economy resource that is charged on time, such as shared parking spaces, accommodation, etc., and can solve the allocation of sharing resources and user pricing problem in the reservation mode based on auction. For the resource allocation problem, this mechanism adopts the idea of critical path to make global plan for each resource, which improves the resource utilization and guarantees the maximization of income. The payment algorithm takes into account critical value to reduce users??payment as far as possible and attract users to participate. The experimental results show that RAUPAM is superior to the traditional FCFS (first-come-first-serve) and MAXBID algorithms in different resource densities and allocation cycles, which indicates that RAUPAM performs better in peak and low peak periods of reservation and is not affected by allocation cycles. Through detailed comparison, the profit of RAUPAM is at least 55% higher than FCFS and 30% higher than MAXBID; its service user rate and utilization of resources are significantly higher than FCFS and MAXBID.

Key words: auction mechanism design, resource allocation, pricing algorithm, sharing economy, critical path