The performance of deferred-acceptance auctions

DOI10.1287/MOOR.2016.0835MaRDI QIDQ4595950zbMATH OpenOpenAlexFDO

Authors Paul Dütting, Vasilis Gkatzelis, Tim Roughgarden

Publication date 7 December 2017

Published in Mathematics of Operations Research (Search for Journal in Brave)

Full work available at URL http://eprints.lse.ac.uk/85524/1/mor-final.pdf

zbMATH Keywords

deferred-acceptance auctionssingle-parameter combinatorial auctions

Mathematics Subject Classification ID

Auctions, bargaining, bidding and selling, and other market models (91B26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32)

Recommendations

• Strategyproof auction mechanisms for network procurement
• Welfare maximization with deferred acceptance auctions in reallocation problems
• Multilateral deferred-acceptance mechanisms
• Price of anarchy for greedy auctions
• Truthful randomized mechanisms for combinatorial auctions

Cited in

(9)

• Two-way greedy: algorithms for imperfect rationality
• Strategyproof auction mechanisms for network procurement
• Modularity and greed in double auctions
• Bribeproof Mechanisms for Two-Values Domains
• Welfare maximization with deferred acceptance auctions in reallocation problems
• Multilateral deferred-acceptance mechanisms
• Obviously Strategyproof Mechanisms for Machine Scheduling.
• Obviously strategyproof single-minded combinatorial auctions
• Automated optimal OSP mechanisms for set systems. The case of small domains

This page was built for publication: The performance of deferred-acceptance auctions

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