Abstract
In this study, we propose a preference elicitation mechanism to reduce users' cost of bidding each time slot in transportation service auction. This mechanism use the relationships of each time slot's private value and interpolate the bidding values which are not stated by users. This research shows the mechanism can reduce the number of bidding. Finally, we evaluate the performance of the preference elicitation mechanism in transportation service auction and the result of numerical simulations indicates that this preference elicitation mechanism works efficiently in cases where user's desired time slot is concentrated.
