Note on an Auction Procedure for a Matching Game in Polynomial Time

DOI10.1007/11775096_36MaRDI QIDQ5434416zbMATH OpenOpenAlexFDO

Authors Winfried. Hochstättler, Hui Jin, Robert M. Nickel

Publication date 4 January 2008

Published in Algorithmic Aspects in Information and Management (Search for Journal in Brave)

Full work available at URL http://e-archive.informatik.uni-koeln.de/491/2/zaik2005-491.pdf

Mathematics Subject Classification ID

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

Recommendations

• On the Nash equilibrium property of an auction matching game
• On multi-object auctions and matching theory: algorithmic aspects
• Tractable combinatorial auctions and \(b\)-matching
• The price of optimum: complexity and approximation for a matching game
• On the complexity of computing an equilibrium in combinatorial auctions
• Market Equilibrium for Combinatorial Auctions and the Matching Core of Nonnegative TU Games
• On simultaneous two-player combinatorial auctions
• Combinatorial games under auction play
• Multiplicative auction algorithm for approximate maximum weight bipartite matching
• Approximation algorithms for combinatorial auctions with complement-free bidders

Cited in

(1)

• Efficient stabilization of cooperative matching games

This page was built for publication: Note on an Auction Procedure for a Matching Game in Polynomial Time

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