657 research outputs found
Rate of Price Discovery in Iterative Combinatorial Auctions
We study a class of iterative combinatorial auctions which can be viewed as
subgradient descent methods for the problem of pricing bundles to balance
supply and demand. We provide concrete convergence rates for auctions in this
class, bounding the number of auction rounds needed to reach clearing prices.
Our analysis allows for a variety of pricing schemes, including item, bundle,
and polynomial pricing, and the respective convergence rates confirm that more
expressive pricing schemes come at the cost of slower convergence. We consider
two models of bidder behavior. In the first model, bidders behave
stochastically according to a random utility model, which includes standard
best-response bidding as a special case. In the second model, bidders behave
arbitrarily (even adversarially), and meaningful convergence relies on properly
designed activity rules
An Agent Based Market Design Methodology for Combinatorial Auctions
Auction mechanisms have attracted a great deal of interest and have been used in diverse e-marketplaces. In particular, combinatorial auctions have the potential to play an important role in electronic transactions. Therefore, diverse combinatorial auction market types have been proposed to satisfy market needs. These combinatorial auction types have diverse market characteristics, which require an effective market design approach. This study proposes a comprehensive and systematic market design methodology for combinatorial auctions based on three phases: market architecture design, auction rule design, and winner determination design. A market architecture design is for designing market architecture types by Backward Chain Reasoning. Auction rules design is to design transaction rules for auctions. The specific auction process type is identified by the Backward Chain Reasoning process. Winner determination design is about determining the decision model for selecting optimal bids and auctioneers. Optimization models are identified by Forward Chain Reasoning. Also, we propose an agent based combinatorial auction market design system using Backward and Forward Chain Reasoning. Then we illustrate a design process for the general n-bilateral combinatorial auction market. This study serves as a guideline for practical implementation of combinatorial auction markets design.Combinatorial Auction, Market Design Methodology, Market Architecture Design, Auction Rule Design, Winner Determination Design, Agent-Based System
Fast Iterative Combinatorial Auctions via Bayesian Learning
Iterative combinatorial auctions (CAs) are often used in multi-billion dollar
domains like spectrum auctions, and speed of convergence is one of the crucial
factors behind the choice of a specific design for practical applications. To
achieve fast convergence, current CAs require careful tuning of the price
update rule to balance convergence speed and allocative efficiency. Brero and
Lahaie (2018) recently introduced a Bayesian iterative auction design for
settings with single-minded bidders. The Bayesian approach allowed them to
incorporate prior knowledge into the price update algorithm, reducing the
number of rounds to convergence with minimal parameter tuning. In this paper,
we generalize their work to settings with no restrictions on bidder valuations.
We introduce a new Bayesian CA design for this general setting which uses Monte
Carlo Expectation Maximization to update prices at each round of the auction.
We evaluate our approach via simulations on CATS instances. Our results show
that our Bayesian CA outperforms even a highly optimized benchmark in terms of
clearing percentage and convergence speed.Comment: 9 pages, 2 figures, AAAI-1
A Free Exchange e-Marketplace for Digital Services
The digital era is witnessing a remarkable evolution of digital services. While the prospects are countless, the e-marketplaces of digital services are encountering inherent game-theoretic and computational challenges that restrict the rational choices of bidders. Our work examines the limited bidding scope and the inefficiencies of present exchange e-marketplaces. To meet challenges, a free exchange e-marketplace is proposed that follows the free market economy. The free exchange model includes a new bidding language and a double auction mechanism. The rule-based bidding language enables the flexible expression of preferences and strategic conduct. The bidding message holds the attribute-valuations and bidding rules of the selected services. The free exchange deliberates on attributes and logical bidding rules for automatic deduction and formation of elicited services and bids that result in a more rapid self-managed multiple exchange trades. The double auction uses forward and reverse generalized second price auctions for the symmetric matching of multiple digital services of identical attributes and different quality levels. The proposed double auction uses tractable heuristics that secure exchange profitability, improve truthful bidding and deliver stable social efficiency. While the strongest properties of symmetric exchanges are unfeasible game-theoretically, the free exchange converges rapidly to the social efficiency, Nash truthful stability, and weak budget balance by multiple quality-levels cross-matching, constant learning and informs at repetitive thick trades. The empirical findings validate the soundness and viability of the free exchange
Delivering services by building and running virtual organisations
Non peer reviewedPostprin
05011 Abstracts Collection -- Computing and Markets
From 03.01.05 to 07.01.05, the
Dagstuhl Seminar 05011``Computing and Markets\u27\u27 was held
in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available
Recommended from our members
Expressive Power-Based Resource Allocation for Data Centers
As data-center energy consumption continues to rise, efficient power management is becoming increasingly important. In this work, we examine the use of a novel market mechanism for finding the right balance between power and performance. The market enables a separation between a 'buyer side' that strives to maximize performance and a 'seller side' that strives to minimize power and other costs. A concise and scalable description language is defined for agent preferences that admits a mixedinteger program for computing optimal allocations. Experimental results demonstrate the robustness, flexibility, practicality and scalability of the architecture.Engineering and Applied Science
Trust-Based Mechanisms for Robust and Efficient Task Allocation in the Presence of Execution Uncertainty
Vickrey-Clarke-Groves (VCG) mechanisms are often used to allocate tasks to selfish and rational agents. VCG mechanisms are incentive-compatible, direct mechanisms that are efficient (i.e. maximise social utility) and individually rational (i.e. agents prefer to join rather than opt out). However, an important assumption of these mechanisms is that the agents will always successfully complete their allocated tasks. Clearly, this assumption is unrealistic in many real-world applications where agents can, and often do, fail in their endeavours. Moreover, whether an agent is deemed to have failed may be perceived differently by different agents. Such subjective perceptions about an agent’s probability of succeeding at a given task are often captured and reasoned about using the notion of trust. Given this background, in this paper, we investigate the design of novel mechanisms that take into account the trust between agents when allocating tasks. Specifically, we develop a new class of mechanisms, called trust-based mechanisms, that can take into account multiple subjective measures of the probability of an agent succeeding at a given task and produce allocations that maximise social utility, whilst ensuring that no agent obtains a negative utility. We then show that such mechanisms pose a challenging new combinatorial optimisation problem (that is NP-complete), devise a novel representation for solving the problem, and develop an effective integer programming solution (that can solve instances with about 2×105 possible allocations in 40 seconds).
- …