# US 2004/0083187 A1 · System for negotiation with mirroring

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

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

## 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 plurality of components are specified to perform a negotiation, where each component is a participant, a coordinator, or both. Each component is provided with a conversion table that maps a set of parameters between invocation patterns instantiated by the participants. Each coordinator is provided with a negotiation graph that it modifies to coordinate its neighborhood of negotiation graphs, and each participant is provided with a negotiation graph that it modifies for each invocation pattern it instantiates. Two message types are sent between components that communicate directly with each other in each neighborhood of negotiation graphs. The two message types are sent between the components to collaboratively mirror their negotiation graphs using their conversion tables in each neighborhood of negotiation graphs so that each participant only views information concerning those aspects in its negotiation graph that relate to the parameters of the invocation patterns it instantiated.

## Claims

### Claim 1

A method for conducting a negotiation among a plurality of participants, comprising:
specifying a plurality of components to perform the negotiation; each component being a participant, a coordinator, or both; providing each component with a conversion table that maps a set of parameters between invocation patterns instantiated by the participants; providing each coordinator with a negotiation graph that it modifies to coordinate its neighborhood of negotiation graphs and each participant with a negotiation graph that it modifies for each invocation pattern it instantiates; and
sending a first message type and a second message type between components that communicate directly with each other in each neighborhood of negotiation graphs; the first message type specifying a request for notification of changes to an aspect of a parameter at a node in the negotiation graph of the component sending the message; the second message type specifying an assertion expressing a decision by a component concerning a property of an aspect of the parameter at a node in the negotiation graph of the component sending the message;
wherein the first message type and the second message type are sent between the components to collaboratively mirror their negotiation graphs using their conversion tables in each neighborhood of negotiation graphs so that each participant only views information concerning those aspects in its negotiation graph that relate to the parameters of the invocation patterns it instantiated.

### Claim 2 (depends on 1)

The method according to claim 1, wherein responsive to receipt of a message of the first message type at a component, the method further comprises:
sending a message of the first type with the request for notification to each component that shares a parameter in the conversion table of the component that received the message of the first type; and
sending a message of the second type for each assertion made concerning the shared parameter that appears in the negotiation graph of the component that received the message of the first type.

### Claim 3 (depends on 2)

The method according to claim 2, wherein responsive to receipt of a message of the second message type at a component, the method further comprises:
sending a message of the second type with the assertion made to each component that shares a parameter in the conversion table of the component that received the message of the second type and that requested information thereon with the message of the first type.

### Claim 4 (depends on 3)

The method according to claim 3, wherein a component that received the message of the first type or the second type sends a message of a third type to open nodes in the negotiation graph when either requests for notification or assertions made concerning a shared parameter are directed to a node that does not exist in the negotiation graph of a component to which it is sent.

### Claim 5 (depends on 1)

The method according to claim 1, wherein each coordinator communicates directly with two or more participants using its conversion table to define a neighborhood of negotiation graphs.

### Claim 6 (depends on 5)

The method according to claim 5, wherein the negotiation includes a first coordinator that is not a participant in the negotiation and a second coordinator that is a participant of the neighborhood of negotiation graphs coordinated by the first coordinator.

### Claim 7 (depends on 5)

The method according to claim 5, wherein the participants in each neighborhood of negotiation graphs communicates directly with no more than one coordinator.

### Claim 8 (depends on 7)

The method according to claim 7, wherein at least one component is a coordinator that is not a participant.

### Claim 9 (depends on 8)

The method according to claim 8, wherein the invocation patterns instantiated by the participants of a neighborhood of negotiation graphs defines a problem statement of the negotiation for which a solution is negotiated using the coordinator of the neighborhood.

### Claim 10 (depends on 1)

The method according to claim 1, wherein the negotiation graph is a tree.

### Claim 11

A system for conducting a negotiation among a plurality of participants, comprising:
a plurality of components for performing the negotiation; each component being a participant, a coordinator, or both; each component being provided with a conversion table that maps a set of parameters between invocation patterns instantiated by the participants; each coordinator being provided with a negotiation graph that it modifies to coordinate its neighborhood of negotiation graphs and each participant with a negotiation graph that it modifies for each invocation pattern it instantiates; and
a first message type and a second message type for sending between components that communicate directly with each other in each neighborhood of negotiation graphs; the first message type specifying a request for notification of changes to an aspect of a parameter at a node in the negotiation graph of the component sending the message; the second message type specifying an assertion expressing a decision by a component concerning a property of an aspect of the parameter at a node in the negotiation graph of the component sending the message;
wherein the first message type and the second message type are sent between the components to collaboratively mirror their negotiation graphs using their conversion tables in each neighborhood of negotiation graphs so that each participant only views information concerning those aspects in its negotiation graph that relate to the parameters of the invocation patterns it instantiated.

### Claim 12 (depends on 11)

The system according to claim 11, wherein each coordinator communicates directly with two or more participants using its conversion table to define a neighborhood of negotiation graphs.

### Claim 13 (depends on 12)

The system according to claim 12, wherein the negotiation includes a first coordinator that is not a participant in the negotiation and a second coordinator that is a participant of the neighborhood of negotiation graphs coordinated by the first coordinator.

### Claim 14 (depends on 12)

The system according to claim 12, wherein the participants in each neighborhood of negotiation graphs communicates directly with no more than one coordinator.

### Claim 15 (depends on 14)

The system according to claim 14, wherein at least one component is a coordinator that is not a participant.

### Claim 16 (depends on 15)

The system according to claim 15, wherein the invocation patterns instantiated by the participants of a neighborhood of negotiation graphs defines a problem statement of the negotiation for which a solution is negotiated using the coordinator of the neighborhood.

### Claim 17 (depends on 11)

The system according to claim 11, wherein responsive to receipt of a message of the first message type at a component:
a message of the first type is sent with the request for notification to each component that shares a parameter in the conversion table of the component that received the message of the first type; and
a message of the second type is sent for each assertion made concerning the shared parameter that appears in the negotiation graph of the component that received the message of the first type.

### Claim 18 (depends on 17)

The system according to claim 17, wherein responsive to receipt of a message of the second message type at a component:
a message of the second type is sent with the assertion made to each component that shares a parameter in the conversion table of the component that received the message of the second type and that requested information thereon with the message of the first type.

### Claim 19 (depends on 18)

The system according to claim 18, further comprising a message of a third type wherein a component that received the message of the first type or the second type sends a message of the third type to open nodes in the negotiation graph when either requests for notification or assertions made concerning a shared parameter are directed to a node that does not exist in the negotiation graph of a component to which it is sent.

### Claim 20 (depends on 11)

The system according to claim 11, wherein the negotiation graph is a tree.
