Mechanisms for multi-unit combinatorial auctions with a few distinct goods

DOI10.1613/JAIR.4587zbMATH Open1325.91026OpenAlexW1257416347MaRDI QIDQ3196307FDOQ3196307

Authors: Piotr Krysta, Carmine Ventre, Orestis A. Telelis 

Publication date: 29 October 2015

Published in: Journal of Artificial Intelligence Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1613/jair.4587

Recommendations

• Truthful randomized mechanisms for combinatorial auctions
• Truthful randomized mechanisms for combinatorial auctions
• An Approximate Truthful Mechanism for Combinatorial Auctions with Single Parameter Agents
• scientific article; zbMATH DE number 2079341
• Incentive compatible mulit-unit combinatorial auctions: a primal dual approach

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26)

Cited In (8)

• Incentive compatible mulit-unit combinatorial auctions: a primal dual approach
• Mechanism design for perturbation stable combinatorial auctions
• Pricing to Maximize Revenue and Welfare Simultaneously in Large Markets
• Network pollution games
• New Results for Network Pollution Games
• Approximation guarantee of OSP mechanisms: the case of machine scheduling and facility location
• Fair and efficient allocation with few agent types, few item types, or small value levels
• Mechanisms for multi-unit auctions

This page was built for publication: Mechanisms for multi-unit combinatorial auctions with a few distinct goods

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3196307)