Search results
Appearance
The page ""In Combinatorial Auctions" journal" does not exist. You can create a draft and submit it for review or request that a redirect be created, but consider checking the search results below to see whether the topic is already covered.
- discrete items that can be traded only as a whole. For example, in combinatorial auctions there is a finite set of items, and every agent can buy a subset...12 KB (1,808 words) - 15:21, 5 April 2021
- indivisible goods. Nisan, Noam (2000). "Bidding and allocation in combinatorial auctions". Proceedings of the 2nd ACM conference on Electronic commerce...3 KB (416 words) - 16:59, 3 January 2024
- consideration of issues of incentive compatibility and demand revelation in combinatorial auctions. A special case of a combinatorial auction is the combinatorial...9 KB (1,079 words) - 14:29, 4 June 2024
- "Tight information-theoretic lower bounds for welfare maximization in combinatorial auctions". Proceedings of the 9th ACM conference on Electronic commerce...21 KB (2,837 words) - 21:53, 4 May 2024
- Clock-Proxy Auction: A Practical Combinatorial Auction Design". In Combinatorial Auctions, Edited by Cramton, P., Shoham, Y., and Steinberg, R. MIT Press...99 KB (12,767 words) - 03:48, 6 September 2024
- that they will pay for items A and B, but only if they get both. In combinatorial auctions, determining the winning bidder(s) can be a complex process where...111 KB (13,531 words) - 01:20, 24 August 2024