A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf
.
An average-case budget-non-negative double auction protocol
2002
Proceedings of the first international joint conference on Autonomous agents and multiagent systems part 1 - AAMAS '02
We develop a new strategy-proof double auction protocol characterized as average-case budget-non-negative. It is wellknown that there is no strategy-proof double auction protocol that satisfies Pareto efficiency, individual rationality, and budget-balance simultaneously. The existing approach is to give up Pareto efficiency or strategy-proofness by enforcing budget-balance or budget-positive as a hard constraint. We propose a new direction to slightly relax the budgetnon-negative condition.
doi:10.1145/544767.544769
fatcat:indhzxvfybcprcdl2oqzc2p5hq