Generalised Network Flows for Combinatorial Auctions

Authors:
Madalina Croitoru;Cornelius Croitoru
Affiliations:
-;-
Venue:
WI-IAT '11 Proceedings of the 2011 IEEE/WIC/ACM International Conferences on Web Intelligence and Intelligent Agent Technology - Volume 02
Year:
2011

Citing 7
Cited 0

Computationally Manageable Combinational Auctions

Management Science
Bidding and allocation in combinatorial auctions

Proceedings of the 2nd ACM conference on Electronic commerce
Winner determination for mixed multi-unit combinatorial auctions via petri nets

Proceedings of the 6th international joint conference on Autonomous agents and multiagent systems
BIDFLOW: a New Graph-Based Bidding Language for Combinatorial Auctions

Proceedings of the 2008 conference on ECAI 2008: 18th European Conference on Artificial Intelligence
Taming the computational complexity of combinatorial auctions: optimal and approximate approaches

IJCAI'99 Proceedings of the 16th international joint conference on Artifical intelligence - Volume 1
Bidding languages and winner determination for mixed multi-unit combinatorial auctions

IJCAI'07 Proceedings of the 20th international joint conference on Artifical intelligence
Bidding languages for combinatorial auctions

IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 2

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we address the problem of (1)representing bids for combinatorial auctions and (2) employing those structures for Winner Determination. We propose a graph-based language employing generalized network flows to represent the bids. The interpretation of winner determination is then seen as an aggregation of individual preferences. We motivate the language from representational, conciseness and manipulation points of view.