By Topic

Rational, Robust, and Secure Negotiation Mechanisms in Multi-Agent Systems (RRS'05)

25-25 July 2005

Filter Results

Displaying Results 1 - 15 of 15
  • Rational, Robust, and Secure Negotiation Mechanisms in Multi-Agent Systems - Cover

    Publication Year: 2005, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (40 KB)
    Freely Available from IEEE
  • First International Workshop on Rational, Robust, and Secure Negotiations in Multi-Agent Systems

    Publication Year: 2005
    Request permission for commercial reuse | PDF file iconPDF (55 KB)
    Freely Available from IEEE
  • Rational, Robust, and Secure Negotiation Mechanisms in Multi-Agent Systems - Copyright Page

    Publication Year: 2005, Page(s): iv
    Request permission for commercial reuse | PDF file iconPDF (53 KB)
    Freely Available from IEEE
  • Rational, Robust, and Secure Negotiation Mechanisms in Multi-Agent Systems - Table of contents

    Publication Year: 2005, Page(s): v
    Request permission for commercial reuse | PDF file iconPDF (37 KB)
    Freely Available from IEEE
  • Preface

    Publication Year: 2005, Page(s): vi
    Request permission for commercial reuse | PDF file iconPDF (24 KB) | HTML iconHTML
    Freely Available from IEEE
  • Acknowledgements

    Publication Year: 2005, Page(s): vii
    Request permission for commercial reuse | PDF file iconPDF (30 KB) | HTML iconHTML
    Freely Available from IEEE
  • Organization

    Publication Year: 2005, Page(s): viii
    Request permission for commercial reuse | PDF file iconPDF (27 KB)
    Freely Available from IEEE
  • A colored Petri net based strategy for multi-agent scheduling

    Publication Year: 2005, Page(s):3 - 10
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (168 KB) | HTML iconHTML

    In the last decade, the focus of agent research has shifted from single agent systems to multi-agent systems (MASs). Dynamic agent coordination is one of the challenge problems of multi-agent research. One coordination problem is how to achieve agent scheduling under open dynamic environments. Petri nets (PNs) and colored Petri nets (CPNs) are system study tools that provide an appropriate mathema... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Human vs. computer behavior in multi-issue negotiation

    Publication Year: 2005, Page(s):11 - 24
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (216 KB) | HTML iconHTML

    This paper presents two experiments that contribute to the comparison of human- versus computer behavior in the domain of multi-issue negotiation. The experiments are part of an ongoing endeavor of improving the quality of computer negotiators when negotiating against human negotiators. The validity of the experiments was tested in a case study of closed multi-issue negotiation involving the ABMP ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • An approach to avoiding shill bids based on combinatorial auction in volume discount

    Publication Year: 2005, Page(s):25 - 38
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (176 KB) | HTML iconHTML

    Volume discount is seen as an effective form of electronic commerce and a promising field for applying agent technologies. In current volume discount mechanisms, items are not allocated efficiently to buyers. Namely, social surplus is not maximum in existing volume discount schemes. To solve this problem, we propose a volume discount mechanism based on the seller's reservation price and the paymen... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Balancing conflict and cost in the selection of negotiation opponents

    Publication Year: 2005, Page(s):39 - 53
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (200 KB) | HTML iconHTML

    Within the context of agent-to-agent purchase negotiations, a problem that has received little attention is that of identifying negotiation opponents in situations where the consequences of conflict and the ability to access resources dynamically vary. Such dynamism poses a number of problems that make it difficult to automate the identification of appropriate opponents. To that end, this paper de... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A dynamic programming approach to automated trust negotiation for multiagent systems

    Publication Year: 2005, Page(s):55 - 65
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB) | HTML iconHTML

    We consider a framework where agents perform trust formation on behalf of human users in open environment like pervasive computing or the Internet. In this paper, an automated trust negotiation framework by van der Host et al. (2004) is proposed, to support such trust agents, and a protocol is presented. In the framework, the preference for the disclosure of credentials and policies are explicitly... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Coalition deal negotiation for services

    Publication Year: 2005, Page(s):67 - 81
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (696 KB) | HTML iconHTML

    This paper investigates an optimal strategy for multiple-issue negotiation for services between interacting agents (service requestors and service providers). We assume the agents are self-interested. They negotiate over both functionality and QoS (quality of service) issues to reach a service agreement, while maximizing their own utilities. We assume each agent only knows its own negotiation para... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Performing more than AC for hard distributed constraint satisfaction problems

    Publication Year: 2005, Page(s):83 - 94
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (192 KB) | HTML iconHTML

    Constraint satisfaction problem (CSP) framework is essentially characterized by the ubiquitous use of local consistency properties and enforcing techniques. The main objective of these techniques is to prune the search space and consequently to enhance the efficiency of the constraint solver. Several levels of local consistency were proposed in the literature among which arc consistency (AC) is th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Author index

    Publication Year: 2005, Page(s): 95
    Request permission for commercial reuse | PDF file iconPDF (26 KB)
    Freely Available from IEEE