3 research outputs found
Market-Based Allocation with Indivisible Bids
Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/73571/1/j.1937-5956.2007.tb00275.x.pd
Multiattribute Call Markets.
Multiattribute auctions support automated negotiation in
settings where buyers and sellers have valuations for alternate
configurations of a good, as defined by configuration
attributes. Bidders express offers to buy or sell alternate
configurations by specifying configuration-dependent reserve prices,
and the auction determines both the traded goods and transaction
prices based on these offers.
While multiattribute auctions have been deployed in single-buyer
procurement settings, the development of double-sided multiattribute
auctions-allowing the free participation of both buyers and
sellers-has received little attention from academia or industry.
In this work I develop a multiattribute call market, a
specific type of double auction in which bids accumulate over an
extended period of time, before the auction determines trades based
on the aggregate collection of bids. Building on a polynomial-time
clearing algorithm, I contribute an efficient algorithm for
information feedback. Supporting the implementation of market-based
algorithms, information feedback support extends the range of
settings for which multiattribute call markets achieve efficiency.
Multiattribute auctions are only one of many auction variants
introduced in recent years. The rapidly growing space of
alternative auctions and trading scenarios calls for both a
standardized language with which to specify auctions, as well as a
computational test environment in which to evaluate alternate
designs. I present a novel auction description language and
deployment environment that supports the specification of a broad
class of auctions, improving on prior approaches through a scripting
language that employs both static parameter settings and rule-based
behavior invocation. The market game platform, AB3D, can
execute these auction scripts to implement multi-auction and
multi-agent trading scenarios.
The efficiency of multiattribute call markets depends crucially on
the underlying valuations of participants. I analyze the expected
performance limitations of multiattribute call markets, using
existing analytical results where applicable. Addressing a lack of
theoretical guidance in many natural settings, I introduce a
computational metric on bidder valuations, and show a correlation
between this metric and the expected efficiency of multiattribute
call markets. As further validation, I integrate multiattribute
markets into an existing supply chain simulation, demonstrating
efficiency gains over a more conventional negotiation procedure.Ph.D.Computer Science & EngineeringUniversity of Michigan, Horace H. Rackham School of Graduate Studieshttp://deepblue.lib.umich.edu/bitstream/2027.42/60822/1/klochner_1.pd
Market-based allocation with indivisible bids
Abstract. We study multi-unit double auctions accepting bids with indivisibility constraints. We propose different price-quote policies and study their influence on the efficiency of market-based allocation. Using a reconfigurable manufacturing scenario where agents trade large quantities of multiple goods, we demonstrate potential benefits of supporting indivisibility constraints in bidding. These benefits are highly sensitive to the form of price quote provided, indicating interesting tradeoffs in communication and allocation efficiency.