165 research outputs found

    Metamodeling approach to preference management in the semantic Web

    Get PDF
    2008 AAAI Workshop; Chicago, IL; United States; 13 July 2008 through 14 July 2008Preference is a superiority state to determine the preferable or the superior of one entity, property or constraint to another from a specified selection set. Preference issue is heavily studied in Semantic Web research area. The existing preference management approaches only consider the importance of concepts for capturing users' interests. This paper presents a metamodeling approach to preference management. Preference meta model consists of concepts and semantic relations to represent users' interests. Users may have the same type preferences in different domains. Thus, metamodeling must be used to define similar preferences for interoperability in different domains. In this paper, preference meta model defines a general storage structure to manage different types of preferences for personalized applications. Copyright © 2008, Association for the Advancement of Artificial Intelligence

    Learning Strong Substitutes Demand via Queries

    Full text link
    This paper addresses the computational challenges of learning strong substitutes demand when given access to a demand (or valuation) oracle. Strong substitutes demand generalises the well-studied gross substitutes demand to a multi-unit setting. Recent work by Baldwin and Klemperer shows that any such demand can be expressed in a natural way as a finite list of weighted bid vectors. A simplified version of this bidding language has been used by the Bank of England. Assuming access to a demand oracle, we provide an algorithm that computes the unique list of weighted bid vectors corresponding to a bidder's demand preferences. In the special case where their demand can be expressed using positive bids only, we have an efficient algorithm that learns this list in linear time. We also show super-polynomial lower bounds on the query complexity of computing the list of bids in the general case where bids may be positive and negative. Our algorithms constitute the first systematic approach for bidders to construct a bid list corresponding to non-trivial demand, allowing them to participate in `product-mix' auctions

    A Free Exchange e-Marketplace for Digital Services

    Get PDF
    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
    • …
    corecore