On bidding algorithms for a distributed combinatorial auction

DOI10.3233/MGS-2011-0170zbMATH Open1229.91147OpenAlexW1682127607MaRDI QIDQ3107969FDOQ3107969

Authors: Benito Mendoza, José Vidal 

Publication date: 28 December 2011

Published in: Multiagent and Grid Systems (Search for Journal in Brave)

Full work available at URL: http://iospress.metapress.com/content/ej27426722w57p86/fulltext.html

Recommendations

• scientific article; zbMATH DE number 1696667
• Approximation algorithms for combinatorial auctions with complement-free bidders
• Approximation algorithms for combinatorial auctions with complement-free bidders
• scientific article; zbMATH DE number 7703279
• The auction algorithm: A distributed relaxation method for the assignment problem
• Combinatorial auctions: a survey
• A new bidding framework for combinatorial e-auctions
• scientific article; zbMATH DE number 2080339
• Randomized algorithms for online bounded bidding

zbMATH Keywords

resource allocationmultiagent systemscombinatorial auctions

Mathematics Subject Classification ID

Combinatorics in computer science (68R05) Auctions, bargaining, bidding and selling, and other market models (91B26) Resource and cost allocation (including fair division, apportionment, etc.) (91B32) Agent technology and artificial intelligence (68T42)

Cited In (4)

• Oblivious Medians Via Online Bidding
• Analysis of Decentralized Quantized Auctions on Cooperative Networks
• Exact algorithms for the matrix bid auction
• A Combinatorial Auction Framework for Solving Decentralized Scheduling Problems (Extended Abstract)

This page was built for publication: On bidding algorithms for a distributed combinatorial auction

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