標題: 利用舒-瑞氏與秘密分享演算法進行公正的資源分配
Justified Resource Allocation through Solimosi-Raghavan and Secret-Sharing Algorithms
作者: 劉思宇
Liu, Szu-Yu
梁高榮
Liang, Gau-Rong
工業工程與管理學系
關鍵字: 公正拍賣;斂核;無線競價;秘密分享技術;舒-瑞氏演算法;Justice-based Auction;Nucleolus;Wireless Bidding;Secret-Sharing Technology;Solymosi-Raghavan Algorithm
公開日期: 2010
摘要: 本文設計公正拍賣系統來作為指派賽局的公正資源分配機制。它的作業流程由前後台的競價步驟組成。在前台部份,競價者透過密碼學裡的秘密分享技術來傳遞無線電標單以避免網路收標單位的可能圍標行為。這實作的軟體模組則稱為無線競價系統。在後台部份,本文選用著名的舒-瑞氏演算法來計算指派賽局的斂核。這實作的軟體模組則稱為斂核計算系統。透過無線競價系統及斂核計算系統,競價者可以容易地透過行動裝置競價並且根據斂核計算系統所求得的公正價格支付標金。
A justice-based auction system has been designed as a fair resource allocation mechanism for assignment game. Its operational procedure consists of competitive steps both at front end and at back end. At the front end, the bidders submit their wireless bids through a secret-sharing procedure in cryptography for avoiding potentially corrupted behavior from their bid receiver on network. Its implemented software package is called Wireless Bidding System (WBS). At the back end, a well-known Solimosi-Raghavan algorithm is chosen to compute the nucleolus of the given assignment game. The implemented software package is named Nucleolus Computing System (NCS). Through the WBS and NCS, the bidders can easily compete with mobile phones and pay with fair prices according to the bidding results.
URI: http://140.113.39.130/cdrfb3/record/nctu/#GT079833507
http://hdl.handle.net/11536/47854
Appears in Collections:Thesis


Files in This Item:

  1. 350701.pdf

If it is a zip file, please download the file and unzip it, then open index.html in a browser to view the full text content.