# US 2004/0083186 A1 · System for negotiation using graphs

> Agents: this data is available as JSON from the patentgrep API and MCP server — see https://patentgrep.com/llms.txt

- Number: US 2004/0083186 A1
- Document ID: US20040083186A1
- Status: Published application
- Kind: A1
- Application number: 10/065,491
- Filed: 2002-10-24
- Published: 2004-04-29
- Earliest claimed: 2002-10-24
- Assignees: Xerox Corporation
- Inventors: Stefania Castellani; Jean-Marc Andreoli
- Web page: https://patentgrep.com/patent/US20040083186A1

## CPC

- G06Q 10/10: Office automation; Time management
- G06Q 50/188: {Electronic negotiation}
- G06Q: INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR

## Abstract

A negotiation is carried out between a plurality of participants. Each participant defines an invocation pattern. A set of coordinator parameters are attached to each invocation pattern, where the set of coordinator parameters define interdependencies between parameters of the plurality of participants that are shared across their invocation patterns. A graph is constructed to carry out the negotiation of a set of actions to be performed by selected ones of the plurality of participants, with nodes of a first node type that represents a negotiating context or a second node type that represents a decision point. The participants construct the graph with primitives instantiated by the invocation patterns. At least one node in the graph is a decision point that merges two or more negotiation contexts into a single decision point. The single decision point combines values of the parameters from the two or more negotiation contexts.

## Claims

### Claim 1

A method for carrying out a negotiation between a plurality of participants, comprising:
defining an invocation pattern for each participant; each invocation pattern being a tuple having at least a name and a set of parameters;
attaching a set of coordinator parameters to each invocation pattern; the set of coordinator parameters defining interdependencies between parameters of the plurality of participants that are shared across their invocation patterns;
constructing a graph to negotiate a set of actions to be performed by selected ones of the plurality of participants; the graph being constructed with nodes of one of a first node type representing a negotiating context and a second node type representing a decision point;
wherein the graph is constructed by the participants with primitives instantiated by the invocation patterns that are used to negotiate values of parameters; and
wherein at least one node in the graph is a decision point that merges two or more negotiation contexts into a single decision point; the single decision point combining values of the parameters from the two or more negotiation contexts.

### Claim 2 (depends on 1)

The method according to claim 1, wherein properties of each parameter are defined by a set of one or more aspects, with each aspect having a constraint.

### Claim 3 (depends on 1)

The method according to claim 1, wherein each negotiating context is associated with a parameter and a term describing an aspect of the value of the parameter in the invocation pattern.

### Claim 4 (depends on 1)

The method according to claim 1, wherein each decision point in the graph has one or more parent nodes that must all be negotiation contexts.

### Claim 5 (depends on 4)

The method according to claim 4, wherein each negotiation context in the graph has one or no parent node that must be a decision point.

### Claim 6 (depends on 5)

The method according to claim 5, wherein the negotiation context with no parent node is a root node that is not the result of a decision.

### Claim 7 (depends on 4)

The method according to claim 4, wherein each decision point is a hyper-arc.

### Claim 8 (depends on 1)

The method according to claim 1, wherein the primitives define a protocol for collaboratively building a graph at each participant.

### Claim 9 (depends on 8)

The method according to claim 8, wherein the graph built at each participant contains only properties of parameters in its invocation pattern.

### Claim 10 (depends on 1)

The method according to claim 1, wherein each negotiation context in the graph is labeled with one or more pairs of: an aspect on a parameter, and a property constraining the aspect's value.

### Claim 11

A system for carrying out a negotiation between a plurality of participants, comprising:
means for defining an invocation pattern for each participant; each invocation pattern being a tuple having at least a name and a set of parameters;
means for attaching a set of coordinator parameters to each invocation pattern;
the set of coordinator parameters defining interdependencies between parameters of the plurality of participants that are shared across their invocation patterns;
means for constructing a graph to negotiate a set of actions to be performed by selected ones of the plurality of participants; the graph being constructed with nodes of one of a first node type representing a negotiating context and a second node type representing a decision point;
wherein the graph is constructed by the participants with primitives instantiated by the invocation patterns that are used to negotiate values of parameters; and
wherein at least one node in the graph is a decision point that merges two or more negotiation contexts into a single decision point; the single decision point combining values of the parameters from the two or more negotiation contexts.

### Claim 12 (depends on 11)

The system according to claim 11, wherein properties of each parameter are defined by a set of one or more aspects, with each aspect having a constraint.

### Claim 13 (depends on 11)

The system according to claim 11, wherein each negotiating context is associated with a parameter and a term describing an aspect of the value of the parameter in the invocation pattern.

### Claim 14 (depends on 11)

The system according to claim 11, wherein each decision point in the graph has one or more parent nodes that must all be negotiation contexts.

### Claim 15 (depends on 14)

The system according to claim 14, wherein each negotiation context in the graph has one or no parent node that must be a decision point.

### Claim 16 (depends on 15)

The system according to claim 15, wherein the negotiation context with no parent node is a root node that is not the result of a decision.

### Claim 17 (depends on 14)

The system according to claim 14, wherein each decision point is a hyper-arc.

### Claim 18 (depends on 11)

The system according to claim 11, wherein the primitives define a protocol for collaboratively building a graph at each participant.

### Claim 19 (depends on 18)

The system according to claim 18, wherein the graph built at each participant contains only properties of parameters in its invocation pattern.

### Claim 20 (depends on 11)

The system according to claim 11, wherein each negotiation context in the graph is labeled with one or more pairs of: an aspect on a parameter, and a property constraining the aspect's value.
