149 research outputs found

    Auction-Based Mechanisms for Electronic Procurement

    Full text link

    Combinatorial auctions for electronic business

    Get PDF
    Combinatorial auctions (CAs) have recently generated significant interest as an automated mechanism for buying and selling bundles of goods. They are proving to be extremely useful in numerous e-business applications such as e-selling, e-procurement, e-logistics, and B2B exchanges. In this article, we introduce combinatorial auctions and bring out important issues in the design of combinatorial auctions. We also highlight important contributions in current research in this area. This survey emphasizes combinatorial auctions as applied to electronic business situations

    Environmental analysis for application layer networks

    Get PDF
    Die zunehmende Vernetzung von Rechnern über das Internet lies die Vision von Application Layer Netzwerken aufkommen. Sie umfassen Overlay Netzwerke wie beispielsweise Peer-to-Peer Netzwerke und Grid Infrastrukturen unter Verwendung des TCP/IP Protokolls. Ihre gemeinsame Eigenschaft ist die redundante, verteilte Bereitstellung und der Zugang zu Daten-, Rechen- und Anwendungsdiensten, während sie die Heterogenität der Infrastruktur vor dem Nutzer verbergen. In dieser Arbeit werden die Anforderungen, die diese Netzwerke an ökonomische Allokationsmechanismen stellen, untersucht. Die Analyse erfolgt anhand eines Marktanalyseprozesses für einen zentralen Auktionsmechanismus und einen katallaktischen Markt. --Grid Computing

    Market-Based Models for Digital Signage Network Promotion Management

    Get PDF
    Digital signage network (DSN) is capable of delivering customized content to designated screens in a real-time or near real-time manner, which provides tremendous potential for building dynamic demand stimulation tools. However current DSN media buying process is mainly carried out through manually conducted negotiation between the DSN operator and the advertisers. This practice does not capitalize the unique technology advantage offered by the newly emerged advertising medium. We propose automated DSN media buying models which allow advertisers to customize their promotion schedules in a highly responsive manner. Specifically, we design a direct revelation mechanism and an iterative bidding model for DSN promotion scheduling. We show that the direct revelation mechanism computes optimal solutions. We evaluate the revenue performance of the iterative bidding model through a computational study. The implementation of the iterative bidding mechanism is also described

    Combinatorial auctions for electronic business

    Get PDF
    Combinatorial auctions (CAs) have recently generated significant interest as an automated mechanism for buying and selling bundles of goods. They are proving to be extremely useful in numerous e-business applications such as e-selling, e-procurement, e-logistics, and B2B exchanges. In this article, we introduce combinatorial auctions and bring out important issues in the design of combinatorial auctions. We also highlight important contributions in current research in this area. This survey emphasizes combinatorial auctions as applied to electronic business situations

    Auctions and bidding: A guide for computer scientists

    Get PDF
    There is a veritable menagerie of auctions-single-dimensional, multi-dimensional, single-sided, double-sided, first-price, second-price, English, Dutch, Japanese, sealed-bid-and these have been extensively discussed and analyzed in the economics literature. The main purpose of this article is to survey this literature from a computer science perspective, primarily from the viewpoint of computer scientists who are interested in learning about auction theory, and to provide pointers into the economics literature for those who want a deeper technical understanding. In addition, since auctions are an increasingly important topic in computer science, we also look at work on auctions from the computer science literature. Overall, our aim is to identifying what both these bodies of work these tell us about creating electronic auctions. © 2011 ACM.This work was funded in part by HP under the “Always on” grant, by NSF IIS-0329037 “Tools and Techniques for Automated Mechanism Design”, and by IEA (TIN2006-15662-C02-01), OK (IST-4-027253-STP), eREP(EC-FP6-CIT5-28575) and Agreement Technologies (CONSOLIDER CSD2007-0022, INGENIO 2010).Peer Reviewe

    Applications of Negotiation Theory to Water Issues

    Get PDF
    The purpose of the paper is to review the applications of non-cooperative bargaining theory to water related issues – which fall in the category of formal models of negotiation. The ultimate aim is that to, on the one hand, identify the conditions under which agreements are likely to emerge, and their characteristics; and, on the other hand, to support policy makers in devising the “rules of the game” that could help obtain a desired result. Despite the fact that allocation of natural resources, especially of trans-boundary nature, has all the characteristics of a negotiation problem, there are not many applications of formal negotiation theory to the issue. Therefore, this paper first discusses the non-cooperative bargaining models applied to water allocation problems found in the literature. Particular attention will be given to those directly modelling the process of negotiation, although some attempts at finding strategies to maintain the efficient allocation solution will also be illustrated. In addition, this paper will focus on Negotiation Support Systems (NSS), developed to support the process of negotiation. This field of research is still relatively new, however, and NSS have not yet found much use in real life negotiation. The paper will conclude by highlighting the key remaining gaps in the literature.Negotiation theory, Water, Agreeements, Stochasticity, Stakeholders
    corecore