article

Mixed multi-unit combinatorial auctions for supply chain management

Authors:

Andrea Giovannucci,

Juan A. Rodriguez-Aguilar,

Meritxell Vinyals,

Jesus Cerquides,

Ulle EndrissAuthors Info & Claims

ACM SIGecom Exchanges, Volume 7, Issue 1

Pages 58 - 60

https://doi.org/10.1145/1345037.1345052

Published: 01 December 2007 Publication History

Get Access

Abstract

Mixed Multi-Unit Combinatorial Auctions (MMUCAs) allow agents to bid for bundles of goods to buy, goods to sell, and transformations of goods. In particular, MMUCAs offer a high potential to be employed for the automated assembly of supply chains of agents offering goods and services, and in general MMUCAs extend and generalise several types of combinatorial auctions. In this letter, we summarise our current research on MMUCAs and highlight lines for future research.

References

[1]

CERQUIDES, J., ENDRISS, U., GIOVANNUCCI, A., AND RODRÍGUEZ-AGUILAR, J. A. 2007. Bidding languages and winnder determination for mixed multi-unit combinatorial auctions. In 20th International Joint Conference on Artificial Intelligence (IJCAI 2007). India, 1221-1226.

Digital Library

Google Scholar

[2]

GIOVANNUCCI, A., RODRÍGUEZ-AGUILAR, J. A., CERQUIDES, J., AND ENDRISS, U. 2007. On the winner determination problem in mixed multi-unit combinatorial auctions. In 6th International Joint Conference on Autonomous Agents and Multi-agent Systems. Hawaii, USA, 710-717.

Digital Library

Google Scholar

[3]

VINYALS, M. AND CERQUIDES, J. 2007. On the empirical evaluation of mixed multi-unit combinatorial auctions. In AAMAS'07 AMEC Workshop. Hawaii, USA, 127-140.

Google Scholar

[4]

WALSH, W. E., WELLMAN, M. P., AND YGGE, F. 2000. Combinatorial auctions for supply chain formation. In 2nd ACM conference on electronic commerce. 260-269.

Digital Library

Google Scholar

Cited By

View all

Bachrach YZuckerman MWooldridge MRosenschein J(2013)Proof systems and transformation gamesAnnals of Mathematics and Artificial Intelligence10.1007/s10472-012-9323-967:1(1-30)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.1007/s10472-012-9323-9
Fionda VGreco G(2009)Charting the tractability frontier of mixed multi-unit combinatorial auctionsProceedings of the 21st International Joint Conference on Artificial Intelligence10.5555/1661445.1661468(134-139)Online publication date: 11-Jul-2009
https://dl.acm.org/doi/10.5555/1661445.1661468
Airy GChen PMullen TYen J(2009)Incorporating Trust into Combinatorial AuctionsProceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 0310.1109/WI-IAT.2009.360(607-613)Online publication date: 15-Sep-2009
https://dl.acm.org/doi/10.1109/WI-IAT.2009.360

Index Terms

Mixed multi-unit combinatorial auctions for supply chain management

Recommendations

A graphical formalism for mixed multi-unit combinatorial auctions

Mixed multi-unit combinatorial auctions are auctions that allow participants to bid for bundles of goods to buy, for bundles of goods to sell, and for transformations of goods. The intuitive meaning of a bid for a transformation is that the bidder is ...
Bidder Support in Multi-item Multi-unit Continuous Combinatorial Auctions: A Unifying Theoretical Framework
Combinatorial auctions have seen limited applications in large-scale consumer-oriented marketplaces, partly due to the substantial complexity to keep track of auction status and formulate informed bidding strategies. We study the bidder support problem ...
Despite known advantages of combinatorial auctions, wide adoption of this allocation mechanism, especially in consumer-oriented marketplaces, is limited partially by the lack of effective bidder support information that can assist bidders to make bidding ...
Bayesian Combinatorial Auctions

We study the following simple Bayesian auction setting: m items are sold to n selfish bidders in m independent second-price auctions. Each bidder has a private valuation function that specifies his or her complex preferences over all subsets of items. ...

Comments

Information & Contributors

Information

Published In

ACM SIGecom Exchanges Volume 7, Issue 1

December 2007

70 pages

EISSN:1551-9031

DOI:10.1145/1345037

Issue’s Table of Contents

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 2007

Published in SIGECOM Volume 7, Issue 1

Check for updates

Author Tags

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

3
Total Citations
View Citations
142
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 23 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Bachrach YZuckerman MWooldridge MRosenschein J(2013)Proof systems and transformation gamesAnnals of Mathematics and Artificial Intelligence10.1007/s10472-012-9323-967:1(1-30)Online publication date: 1-Jan-2013
https://dl.acm.org/doi/10.1007/s10472-012-9323-9
Fionda VGreco G(2009)Charting the tractability frontier of mixed multi-unit combinatorial auctionsProceedings of the 21st International Joint Conference on Artificial Intelligence10.5555/1661445.1661468(134-139)Online publication date: 11-Jul-2009
https://dl.acm.org/doi/10.5555/1661445.1661468
Airy GChen PMullen TYen J(2009)Incorporating Trust into Combinatorial AuctionsProceedings of the 2009 IEEE/WIC/ACM International Joint Conference on Web Intelligence and Intelligent Agent Technology - Volume 0310.1109/WI-IAT.2009.360(607-613)Online publication date: 15-Sep-2009
https://dl.acm.org/doi/10.1109/WI-IAT.2009.360

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Cited By

Index Terms

Recommendations

A graphical formalism for mixed multi-unit combinatorial auctions

Bidder Support in Multi-item Multi-unit Continuous Combinatorial Auctions: A Unifying Theoretical Framework

Bayesian Combinatorial Auctions

Comments

Published In

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Other Metrics

Article Metrics

Other Metrics

Cited By

Login options

Full Access

PDF

eReader

Abstract

References

Cited By

Index Terms

Recommendations

A graphical formalism for mixed multi-unit combinatorial auctions

Bidder Support in Multi-item Multi-unit Continuous Combinatorial Auctions: A Unifying Theoretical Framework

Bayesian Combinatorial Auctions

Comments

Information

Published In

Publisher

Publication History

Check for updates

Author Tags

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

Login options

Full Access

View options

PDF

eReader

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations