Scott Jamison

Learn More
WC present a testbed for multi-agent negotiation, imple-mcntcd as a gcncralizcd market architecture called MAGNET (Multi AGcnt NEgotiation Testbed). In contrast with other approaches to multi-agent negotiation, we introduce an explicit intermediary into the negotiation process. We show how this approach helps in controlling fraud and discouraging(More)
Much recent work in automated contracting in multi-agent environments has focused on the design and analysis of protocols that encourage customers and suppliers to negotiate fairly, and that attempt to reduce unproductive strategic counterspeculation. Most of these studies focus on how the static structure of the protocol may result in strategic behavior on(More)
We present a generalized market architecture that provides support for a variety of types of transactions, from simple buying and selling of goods and services to complex multi-agent contract negotiations. This architecture is organized around three basic components: the exchange, the market, and the session. We also present a negotiation protocol for(More)
Much recent work in automated contracting in multi-agent environments has focused on the design and analysis of protocols that encourage customers and suppliers to negotiate fairly, and that attempt to reduce unproductive strategic counterspeculation. Most of these studies focus on how the static structure of the protocol may result in strategic behavior on(More)
The computational structure of monotone monadic-snp and constraint satisfaction: A study through datalog and group theory. The monadic second-order logic of graphs V: On closing the gap between deenability and recognizability. Cou94b] B. Courcelle. The monadic second-order logic of graphs VI: On several representations of graphs by relational structures. 25(More)
  • R Ghr, H J Greenlaw, W L Hoover, Ruzzo, Limits, M G Gj +5 others
  • 1998
7)) algorithm for the 3-clique-width problem. Preprint, 1998. Sha98] A. Sharell. Complexit e Descriptive et l'approximation des fonctions de d enombrement. J. Makowsky and U. Rotics. On the cliquewidth of graphs with few P4's. Linear time solvable optimization problems on certain structured graph families, extended abstract. Cou99] B. Courcelle. The monadic(More)
  • 1