This idea mainly solves two problems. In the time and space sequence of repeated games, an order and mechanism are established to form a gradually clearing sequence.
-
Game participants are time-sensitive and hope to end the transaction (time) as soon as possible.
-
Game participants are price-sensitive and hope to get better prices (space).
Main methods and processes:
-
Combined with multiple auctions and GS matching theory.
-
Each time the matching transaction parties are "screened out" based on the results.
-
The supply and demand sides that have not reached a deal will adopt the method suggested by the 2020 Nobel Prize winner: publish the highest price and enter the next round.
-
Until the exit criteria for the current stage are reached:
-
All supply and demand cleared
-
Maximum number of transactions reached
-
Maximum time limit reached
Machine-translated from the Chinese original 智能撮合交易机制 ——基于GS匹配和2020诺奖得主的拍卖机制 (published 2020-12-07). WeChat original ↗