research-article

Winner determination for mixed multi-unit combinatorial auctions via petri nets

Authors:

Andrea Giovannucci,

J. A. Rodriguez-Aguilar,

Jesus Cerquides,

Ulle EndrissAuthors Info & Claims

AAMAS '07: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems

Article No.: 104, Pages 1 - 8

https://doi.org/10.1145/1329125.1329253

Published: 14 May 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. Here we provide a formalism, based on an extension of Petri Nets, with which MMUCAs, and therefore all auction types subsumed by MMUCAs --- and in particular combinatorial auctions for supply chain formation (SCF)---, can be formally analysed. As a second direct benefit, consequence of the provided mapping to Petri Nets, we manage to dramatically reduce the number of decision variables involved in the optimisation problem posed by MMUCAs from quadratic to linear for a wide class of MMUCA Winner Determination Problems (WDPs). Hence, we also make headway in the practical application of MMUCAs, and in particular to SCF.

References

[1]

J. Cerquides, U. Endriss, A. Giovannucci, and J. A. Rodriguez-Aguilar. Bidding languages and winner determination for mixed multi-unit combinatorial auctions. In Proc. of the 20th Intl. Joint Conferences on Artif. Intelligence, pages 1221--1226, 2007.

Digital Library

Google Scholar

[2]

P. Cramton, Y. Shoham, and R. Steinberg, editors. Combinatorial Auctions. MIT Press, 2006.

Digital Library

Google Scholar

[3]

J. Esparza and S. Melzer. Verification of safety properties using integer programming: Beyond the state equation. Formal Methods in System Design, 16:159--189, 2004.

Digital Library

Google Scholar

[4]

T. Murata. Petri nets: Properties, analysis and applications. In IEEE, volume 77, pages 541--580, 1989.

Google Scholar

[5]

N. Nisan. Bidding languages for combinatorial auctions. In P. Cramton et al., editors, Combinatorial Auctions. MIT Press, 2006.

Google Scholar

[6]

W. E. Walsh, M. P. Wellman, and F. Ygge. Combinatorial auctions for supple chain formation. In Proc. of the 2nd ACM Conference on Electronic Commerce, 2000.

Digital Library

Google Scholar

[7]

T. Watanabe. The legal firing sequence problem of petri nets. IEICE Transactions on Information and Systems, 3:397--406, 2000.

Google Scholar

Cited By

View all

Kumar DBaranwal GVidyarthi D(2021)Fair Resource Allocation Policies in Reverse Auction-Based Cloud MarketSN Computer Science10.1007/s42979-021-00907-y2:6Online publication date: 13-Oct-2021
https://doi.org/10.1007/s42979-021-00907-y
Covaci F(2019)Automating Forward and Reverse Supply Chains in the Context of Industry 4.0Studia Universitatis Babes-Bolyai Oeconomica10.2478/subboec-2019-000264:1(16-32)Online publication date: 27-May-2019
https://doi.org/10.2478/subboec-2019-0002
Harishankar MPilaka SSharma PSrinivasan NJoe-Wong CTague P(2019)Procuring Spontaneous Session-Level Resource Guarantees for Real-Time Applications: An Auction ApproachIEEE Journal on Selected Areas in Communications10.1109/JSAC.2019.291648737:7(1534-1548)Online publication date: Jul-2019
https://doi.org/10.1109/JSAC.2019.2916487
Show More Cited By

Recommendations

Comparing winner determination algorithms for mixed multi-unit combinatorial auctions
AAMAS '08: Proceedings of the 7th international joint conference on Autonomous agents and multiagent systems - Volume 3

Mixed multi-unit combinatorial auctions are combinatorial auctions in which the auctioneer and the bidders negotiate over transformations rather than over simple goods. By proposing a transformation a bidder is offering to produce a certain set of ...
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 ...

Comments

Information & Contributors

Information

Published In

AAMAS '07: Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems

May 2007

1585 pages

ISBN:9788190426275

DOI:10.1145/1329125

Conference Chairs:
Edmund Durfee
University of Michigan
,
Makoto Yokoo
Kyushu University
,
Program Chairs:
Michael Huhns
University of South Carolina
,
Onn Shehory
IBM Haifa Research Lab, Israel

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 14 May 2007

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Funding Sources

Ministerio de Educación, Cultura y Deporte

Conference

AAMAS07

Sponsor:

AAMAS07: International Conference on Autonomous Agents and Mulitagent Systems

May 14 - 18, 2007

Hawaii, Honolulu

Acceptance Rates

Overall Acceptance Rate 1,155 of 5,036 submissions, 23%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

23
Total Citations
View Citations
167
Total Downloads

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

Reflects downloads up to 23 Dec 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Kumar DBaranwal GVidyarthi D(2021)Fair Resource Allocation Policies in Reverse Auction-Based Cloud MarketSN Computer Science10.1007/s42979-021-00907-y2:6Online publication date: 13-Oct-2021
https://doi.org/10.1007/s42979-021-00907-y
Covaci F(2019)Automating Forward and Reverse Supply Chains in the Context of Industry 4.0Studia Universitatis Babes-Bolyai Oeconomica10.2478/subboec-2019-000264:1(16-32)Online publication date: 27-May-2019
https://doi.org/10.2478/subboec-2019-0002
Harishankar MPilaka SSharma PSrinivasan NJoe-Wong CTague P(2019)Procuring Spontaneous Session-Level Resource Guarantees for Real-Time Applications: An Auction ApproachIEEE Journal on Selected Areas in Communications10.1109/JSAC.2019.291648737:7(1534-1548)Online publication date: Jul-2019
https://doi.org/10.1109/JSAC.2019.2916487
Zhang XTang HYang DEl-Meligy MLi Z(2018)Comparative Analysis of Sequential and Combinatorial Auctions Based on Petri NetsIEEE Access10.1109/ACCESS.2018.28405396(38071-38085)Online publication date: 2018
https://doi.org/10.1109/ACCESS.2018.2840539
Covaci F(2017)Optimizing Service Level Agreements in Peer-to-Peer Supply Chain Model for Complex Projects ManagementInformatics in Economy10.1007/978-3-319-73459-0_2(23-37)Online publication date: 28-Dec-2017
https://doi.org/10.1007/978-3-319-73459-0_2
Kong YZhang MYe DZhu JChoi J(2017)An intelligent agent‐based method for task allocation in competitive cloud environmentsConcurrency and Computation: Practice and Experience10.1002/cpe.417830:3Online publication date: 20-Jun-2017
https://doi.org/10.1002/cpe.4178
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
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
Croitoru MRudolph S(2012)Exclusivity-based allocation of knowledgeProceedings of the 11th International Conference on Autonomous Agents and Multiagent Systems - Volume 310.5555/2343896.2343946(1249-1250)Online publication date: 4-Jun-2012
https://dl.acm.org/doi/10.5555/2343896.2343946
Winsper MChli M(2012)DECENTRALIZED SUPPLY CHAIN FORMATION USING MAX‐SUM LOOPY BELIEF PROPAGATIONComputational Intelligence10.1111/j.1467-8640.2012.00446.x29:2(281-309)Online publication date: 4-Jul-2012
https://doi.org/10.1111/j.1467-8640.2012.00446.x
Show More Cited By

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

Recommendations

Comparing winner determination algorithms for mixed multi-unit combinatorial auctions

A graphical formalism for mixed multi-unit combinatorial auctions

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