A Strategy-Proof Online Auction with Time Discounting Values
نویسندگان
چکیده
Online mechanism design has been widely applied to various practical applications. However, designing a strategy-proof online mechanism is much more challenging than that in a static scenario due to short of knowledge of future information. In this paper, we investigate online auctions with time discounting values, in contrast to the flat values studied in most of existing work. We present a strategy-proof 2-competitive online auction mechanism despite of time discounting values. We also implement our design and compare it with offline optimal solution. Our numerical results show that our design achieves good performance in terms of social welfare, revenue, average winning delay, and average valuation loss.
منابع مشابه
Optimal Price Decremental Strategy for Dutch Auctions∗
In a Dutch auction, the price of an item decreases incrementally from the starting price at regular intervals. A bidder may buy the item at any time and stop the auction at the current price. This paper presents an optimal price decrement strategy in a Dutch auction, such that the expected revenue of the auction host is maximized. Properties of the optimal solution and a simple iterative soluti...
متن کاملA Comparative Study of Multi-Attribute Continuous Double Auction Mechanisms
Auctions have been as a competitive method of buying and selling valuable or rare items for a long time. Single-sided auctions in which participants negotiate on a single attribute (e.g. price) are very popular. Double auctions and negotiation on multiple attributes create more advantages compared to single-sided and single-attribute auctions. Nonetheless, this adds the complexity of the auctio...
متن کاملAn Iterative Generalized Vickrey Auction: Strategy-Proofness without Complete Revelation
The generalized Vickrey auction (GVA) is a strategy-proof combinatorial auction, in which truthful bidding is the optimal strategy for an agent. In this paper we address a fundamental problem with the GVA, which is that it requires agents to compute and reveal their values for all combinations of items. This can be very difficult for bounded-rational agents with limited or costly computation. W...
متن کاملCoalgebraic Analysis of Subgame-perfect Equilibria in Infinite Games without Discounting
We present a novel coalgebraic formulation of infinite extensive games. We define both the game trees and the strategy profiles by possibly infinite systems of corecursive equations. Certain strategy profiles are proved to be subgame perfect equilibria using a novel proof principle of predicate coinduction. We characterize all subgame perfect equilibria for the dollar auction game. The economic...
متن کاملPrice-oriented, Rationing-free Protocol: Guideline for Designing Strategy/False-name Proof Auction Protocols
We identify a distinctive class of combinatorial auction protocols called a Price-oriented, Rationing-free (PORF) protocol, which can be used as a guideline for developing strategy/false-name proof protocols. A PORF protocol is automatically guaranteed to be strategy-proof, i.e., for each agent, declaring its true evaluation values is an optimal strategy regardless of the declarations of other ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014