Information Technology Reference
In-Depth Information
Update-Best-Bid()
1
for
b ∈ list
-
of
-
bids
do
demand
[
b
]
←
g∈b
g
ask
-
value
[
g
]
2
b
p
3
ready
-
to
-
clear
←{
b
∈
list
-
of
-
bids
|
demand
[
b
]
≤
}
4
if
ready
-
to
-
clear
=
∅
5
then
6
Sort
ready
-
to
-
clear
first by
demand
and second by bid id.
7
best
-
bid ←
first(
ready
-
to
-
clear
)
for
agent ∈ best
-
bid
g
8
9
do
agent .
Ready(
i, best
-
bid
)
10
mMCP()
1
for
j ∈ G
2
do
ask
-
value
[
j
]
←∞
neighbors ←
b∈g
i
b
g
3
list
-
of
-
bids ← g
i
4
for
ask
-
value
[
i
]
←
max
b∈g
i
b
p
to
0
step
1
5
6
do for
agent
∈
neighbors
7
do
agent .
Tell-Ask-Value(
i, ask
-
value
[
i
])
8
Wait for all
neighbors
to tell me their
ask
-
value
9Ex t
Unable to clear my good.
Fig. 4.
Modified MCP main procedures.The algorithm starts by having all agents ex-
ecute mMCP
3. If the agent can get its
ask
-
value
on any bid, it clears the bid and it informs
the other agents with which it is negotiating that it is out of negotiations.
Just like in MCP, since every node has to lower its
ask
-
value
in successive it-
erations, the nodes converge to a solution. However, a problem with the mMCP
is that it can cause some revenue to be left unallocated, which happens when
the revenue is not evenly divisible by the number of participants given the decre-
ment step (which is 1 in the algorithm as shown but can be set to any positive
constant). See Figures 3 and 4 for the detailed algorithm.
7.2
Sociological Network Exchange Theory
Sociological Network Exchange Theory (NET) studies the effects of power on the
outcomes of exchanges between people in power relation-networks. In a network,
the nodes are the participants and any two nodes can negotiate (for dividing a
resource or exchanging goods) if they have an edge between them. The edges
represent the amount the agents are trying to divide. Based on extensive studies
with human subjects, Sociologists have been able to identify equations that can
predict the outcome of human negotiations in particular networks.
Specifically, in [15, Chapter 2] Willer presents an equation which predicts that
an exchange occurs on any relation between two nodes at equi-resistance. For
