Schemes to reward winners in combinatorial double auctions based on optimization of surplus
作者：
Highlights：
• We propose a model to reward winners in combinatorial double auctions.
• We propose schemes to reward winners based on surplus optimization.
• We formulate the problem to maximize the surplus of auctions.
• We propose an algorithm to solve surplus optimization problem.
• We illustrate the effectiveness of our algorithms.
摘要
•We propose a model to reward winners in combinatorial double auctions.•We propose schemes to reward winners based on surplus optimization.•We formulate the problem to maximize the surplus of auctions.•We propose an algorithm to solve surplus optimization problem.•We illustrate the effectiveness of our algorithms.
论文关键词：Double auction,Integer programming,Combinatorial auction
论文评审过程：Received 20 August 2014, Revised 2 April 2015, Accepted 23 May 2015, Available online 17 June 2015, Version of Record 7 December 2015.
论文官网地址：https://doi.org/10.1016/j.elerap.2015.05.002
