Abstract. This paper deals with multi-unit combinatorial auctions where there are n types of goods for sale, and for each good there is some fixed number of ...
Abstract. This paper deals with multi-unit combinatorial auctions where there are n types of goods for sale, and for each good there is some fixed number of ...
This paper deals with multi-unit combinatorial auctions where there are n types of goods for sale, and for each good there is some fixed number of units.
Abstract. We characterize incentive compatibility in multi-unit auctions with multi-dimensional types. An allocation mechanism is incentive compatible if ...
People also ask
This paper provides incentive compatible mechanisms for combinatorial auctions for the general case where bidders are not limited to single minded ...
The problem we deal with in this paper is a multi-unit combinatorial auction: there are n types of goods for sale, and for each i there are k i units of ...
Abstract. We characterize incentive compatibility in multi-unit auctions with multi-dimensional types. An allocation mechanism is incentive compatible if ...
Abstract. We present an incentive-compatible polynomial-time approximation scheme for multi- unit auctions with general k-minded player valuations.
We study multi-unit combinatorial auctions with multi-minded buyers. We provide two deterministic, efficient maximizing, incentive compatible mechanisms ...
This paper deals with multi-unit combinatorial auctions where there are n types of goods for sale, and for each good there is some fixed number of units.