Article

Charting the tractability frontier of mixed multi-unit combinatorial auctions

Authors:

Valeria Fionda,

Gianluigi GrecoAuthors Info & Claims

IJCAI'09: Proceedings of the 21st International Joint Conference on Artificial Intelligence

Pages 134 - 139

Published: 11 July 2009 Publication History

Abstract

Mixed multi-unit combinatorial auctions (MMUCAs) are extensions of classical combinatorial auctions (CAs) where bidders trade transformations of goods rather than just sets of goods. Solving MMUCAs, i.e., determining the sequences of bids to be accepted by the auctioneer, is computationally intractable in general. However, differently from CAs, little was known about whether polynomial-time solvable classes of MMUCAs can be singled out based on constraining their characteristics.

The paper precisely fills this gap, by depicting a clear picture of the "tractability frontier" for MMUCA instances under both structural and qualitative restrictions, which characterize interactions among bidders and types of bids involved in the various transformations, respectively. By analyzing these restrictions, a sharp frontier is charted based on various dichotomy results. In particular, tractability islands resulting from the investigation generalize on MMUCAs the largest class of tractable CAs emerging from the literature.

References

[1]

{Babaioff et al., 2008} M. Babaioffs, P. Briest, and P. Krysta. On the Approximability of Combinatorial Exchange Problems. In Proc. of SAGT'08, pp. 83-94, 2008.

Digital Library

Google Scholar

[2]

{Cerquides et al., 2007} J. Cerquides, U. Endriss, A. Giovannucci, and J. A. Rodriguez-Aguilar. Bidding languages and winner determination for mixedmulti-unit combinatorial auctions. In Proc. of IJCAI'07, pp. 1221-1226, 2007.

Digital Library

Google Scholar

[3]

{Conitzer et al., 2004} V. Conitzer, J. Derryberry, and T. Sandholm. Combinatorial auctions with structured item graphs. In Proc. of AAAI'04, pp. 212-218, 2004.

Digital Library

Google Scholar

[4]

{Giovannucci et al., 2007} A. Giovannucci, J. A. Rodriguez-Aguilar, M. Vinyals, J. Cerquides, and U. Endriss. Mixed multi-unit combinatorial auctions for supply chain management. SIGecom Exch., 7(1):58-60, 2007.

Digital Library

Google Scholar

[5]

{Gottlob and Greco, 2007} G. Gottlob and G. Greco. On the complexity of combinatorial auctions: structured item graphs and hypertree decomposition. In Proc. of EC'07, pp. 152-161, 2007.

Digital Library

Google Scholar

[6]

{Gottlob et al., 2002} G. Gottlob, N. Leone, and S. Scarcello. Hypertree decompositions and tractable queries. Journal of Computer and System Sciences, 63(3):579-627, 2002.

Digital Library

Google Scholar

[7]

{Kleinberg and Tardos, 2005} J. Kleinberg and E. Tardos. Algorithm Design. Addison Wesley, 2005.

Digital Library

Google Scholar

[8]

{Lehmann et al., 2006} D. Lehmann, R. Müller, and T. Sandholm. The Winner Determination Problem. Combinatorial Auctions. MIT Press, 2006.

Google Scholar

[9]

{Ottens and Endriss, 2008} B. Ottens and U. Endriss. Comparing winner determination algorithms for mixed multiunit combinatorial auctions. In Proc. of AAMAS'08, pp. 1601-1604, 2008.

Digital Library

Google Scholar

[10]

{Walsh and Wellman, 2003} W. E. Walsh and M. P. Wellman. Decentralized supply chain formation: A market protocol and competititve equilibrium analysis. Journal of Aritificial Intelligence Research, 19:513-567, 2003.

Digital Library

Google Scholar

Cited By

View all

Fionda VGreco G(2013)The complexity of mixed multi-unit combinatorial auctionsArtificial Intelligence10.1016/j.artint.2012.12.002196(1-25)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1016/j.artint.2012.12.002
Penya-Alba TCerquides JRodriguez-Aguilar JVinyals M(2012)Scalable decentralized supply chain formation through binarized belief propagationProceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 310.5555/2343896.2343960(1275-1276)Online publication date: 4-Jun-2012
https://dl.acm.org/doi/10.5555/2343896.2343960
Witzel AEndriss ULuck MSen S(2010)Time constraints in mixed multi-unit combinatorial auctionsProceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 110.5555/1838206.1838445(1487-1488)Online publication date: 10-May-2010
https://dl.acm.org/doi/10.5555/1838206.1838445
Show More Cited By

Charting the tractability frontier of mixed multi-unit combinatorial auctions
1. Theory of computation

Recommendations

Decision support for multi-unit combinatorial bundle auctions

Single item auctions are by far the most common auction format, but they are not always efficient. Combinatorial auctions are beneficial, when complementarities exist between the items to be auctioned. There are, however, several problems with the ...
The complexity of mixed multi-unit combinatorial auctions: Tractability under structural and qualitative restrictions

Mixed multi-unit combinatorial auctions (MMUCAs) are extensions of classical combinatorial auctions (CAs) where bidders trade transformations of goods rather than just sets of goods. Solving MMUCAs, i.e., determining the sequences of bids to be accepted ...
Incentive compatible budget elicitation in multi-unit auctions
SODA '10: Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete algorithms

In this paper, we consider the problem of designing incentive compatible auctions for multiple (homogeneous) units of a good, when bidders have private valuations and private budget constraints. When only the valuations are private and the budgets are ...

Comments

Information & Contributors

Information

Published In

IJCAI'09: Proceedings of the 21st International Joint Conference on Artificial Intelligence

July 2009

2107 pages

Editor:
Hiroaki Kitano

Publisher

Morgan Kaufmann Publishers Inc.

San Francisco, CA, United States

Publication History

Published: 11 July 2009

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

4
Total Citations
View Citations
0
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

Fionda VGreco G(2013)The complexity of mixed multi-unit combinatorial auctionsArtificial Intelligence10.1016/j.artint.2012.12.002196(1-25)Online publication date: 1-Mar-2013
https://dl.acm.org/doi/10.1016/j.artint.2012.12.002
Penya-Alba TCerquides JRodriguez-Aguilar JVinyals M(2012)Scalable decentralized supply chain formation through binarized belief propagationProceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 310.5555/2343896.2343960(1275-1276)Online publication date: 4-Jun-2012
https://dl.acm.org/doi/10.5555/2343896.2343960
Witzel AEndriss ULuck MSen S(2010)Time constraints in mixed multi-unit combinatorial auctionsProceedings of the 9th International Conference on Autonomous Agents and Multiagent Systems: volume 1 - Volume 110.5555/1838206.1838445(1487-1488)Online publication date: 10-May-2010
https://dl.acm.org/doi/10.5555/1838206.1838445
Almajano PCerquides JRodriguez-Aguilar J(2009)Empirical hardness for mixed auctionsProceedings of the Current topics in artificial intelligence, and 13th conference on Spanish association for artificial intelligence10.5555/1893496.1893518(161-170)Online publication date: 9-Nov-2009
https://dl.acm.org/doi/10.5555/1893496.1893518

Abstract

References

Cited By

Recommendations

Decision support for multi-unit combinatorial bundle auctions

The complexity of mixed multi-unit combinatorial auctions: Tractability under structural and qualitative restrictions

Incentive compatible budget elicitation in multi-unit auctions

Comments

Information

Published In

Sponsors

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations