Report On Algorithms For Complete Set Partitioning Problem
Report On Algorithms For Complete Set Partitioning Problem
PARTITIONING PROBLEM
B.Tech.
in
Information Technology
by
Certificate
This is to certify that this report entitled “ Algorithms for Complete Set Par-
(14/IT/58) for the partial fulfilment of the requirements for the degree of
Prof.Animesh Dutta
Assistant Professor
Dept. of Information
Technology
N.I.T. Durgapur
Durgapur, West Bengal
Abstract
The Complete Set Partitioning problem models the setting where every sub-
set of a finite set is associated with a (positive or negative) real value, and the
In this article, our main goal is to improve our understanding of the com-
plete set partitioning problem and to develop exact and heuristic algorithms
for this problem. Observe that the input to the complete set partitioning
problem is a list of 2n−1 real values (where n is the size of the ground set),
instance of this problem has to inspect all of these values. Thus, the running
that can find an optimal partition as efficiently as possible, both in the worst
1.1 Agents . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3
1.2.1 Reactivity . . . . . . . . . . . . . . . . . . . . . . . . . 4
1.2.2 Proactiveness . . . . . . . . . . . . . . . . . . . . . . . 4
1.2.4 Situatedness . . . . . . . . . . . . . . . . . . . . . . . 5
1.2.5 Autonomy . . . . . . . . . . . . . . . . . . . . . . . . . 5
1.2.6 Adaptivity . . . . . . . . . . . . . . . . . . . . . . . . 5
1.2.7 Sociability . . . . . . . . . . . . . . . . . . . . . . . . . 5
1
3.2 Complete set partitioning problem and its relation with coali-
tions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 10
2
Chapter 1
Introduction :Agents in
artificial intelligence
1.1 Agents
Agent is an autonomous entity which observes through sensors and acts upon
goals. Intelligent agents may also learn or use knowledge to achieve their
goals. They may be very simple or very complex. A reflex machine, such as
economics, and versions of the intelligent agent paradigm are studied in cog-
3
Intelligent agents are also closely related to software agents (an au-
computer science, the term intelligent agent may be used to refer to a soft-
ware agent that has some intelligence, regardless if it is not a rational agent
1.2.1 Reactivity
1.2.2 Proactiveness
Intelligent agents can take the initiative to meet their design objectives,
4
1.2.3 Social ability
Intelligent agents can interact with other agents to satisfy their design
objectives.
1.2.4 Situatedness
When an Agent receives some form of sensory input from its environment,
it then performs some actions that change its environment in some way.
1.2.5 Autonomy
This agent characteristic means that an agent is able to act without direct
intervention from humans or other agents. This type of agent has almost
1.2.6 Adaptivity
initiatives when appropriate and is also capable of learning from it’s own
1.2.7 Sociability
5
Chapter 2
reinforcement learning.
6
Learning agent
complexity. Typically agents are situated in space and time and reside in
programs. In some cases, though not always, the agents may be considered
7
Agent-based model
agent-based model
rules that formed their behaviours. MAS designed for engineering and
applied science, while ABM is quite good with natural systems. MAS can
8
Chapter 3
Coalition formation theory deals with the analysis of one or more groups of
formation theories. One of them concerns the formation of groups, that is,
9
enforcement of group actions as the equilibrium of an appropriate game.
The Complete Set Partitioning problem models the setting where every
and the goal is to partition the set into pairwise disjoint subsets so as to
has been studied in the context of combinatorial auctions, where there are
multiple different items for sale, each bidder can place a bid on every
subset of items, and the auctioneer’s goal is to allocate the items to the
bidders (and charge each bidder what she bid for the set of items she
for each other’s deficiencies. One means of interaction that has been
agents that agree to coordinate their activities (and possibly agree on how
10
games. In such games, we are given a set of agents, denoted by A, and the
agents into coalitions (a coalition structure) that maximizes the sum of the
networks can increase their throughput, and buyers can obtain cheaper
a list of 2(n−1) real values (where n is the size of the ground set), and every
of this problem has to inspect all of these values. Thus, the running time
11
Chapter 4
when the size of instance grows, the running time for exhaustive search
soon becomes forbiddingly large even for an instance of fairly small size.
faster than exhaustive search, though still not polynomial time. These fast,
12
4.1 The D.P. Algorithm
This algorithm was originally proposed by Yeh to solve the complete set
partition of A is found.
in figure.
dealing with the complete set partitioning problem, and the input to this
13
problem contains 2n values already. In other words, we implicitly assume
there is O (2n ) available space. The running time of DP has been shown to
Algorithm:
14
A working example of dp on four agents
15
Coalition structure graph on four agents
The work of DP into three main tasks, which can all be seen on the graph.
coalition C with size(C) ≥2, the algorithm evaluates every partition C’, C”
Since the algorithm does this for every possible coalition of size s ≥2, all
movement that involves splitting C and, if so, what is the best such
hand, setting t(C) = C’, C” means that, from any node representing C ∈
16
CS, one of the most beneficial movements is to split C into C’ and C”.
i.e., the bottom node in the graph. After that, DP selects some coalition C
∈ CS ∗ with t(C)6=(C) (if such a coalition exists), and replaces it with t(C).
two coalitions that are stored in t(C). This process is repeated until t(C)
={C} for all C ∈ CS. In other words, DP keeps moving upwards in the
from Fig, the way DP reached {{a1}, {a2}, {a3, a4}}can be visualized as a
sequence of movements through the dashed path in Fig, where the first
movement involved splitting {a1, a2, a3, a4}into {a1, a2}and {a3, a4}, and
17
Chapter 5
are not necessarily optimal but are close to optimal (Blumenfeld, 2009). In
solution. However they provide solutions that are adequate for practical
heuristic methods has been shown to be faster than DP, by several orders
methods are able to identify many (if not the vast majority of) subspaces
18
Returning solutions anytime: The key feature of an anytime
anytime algorithms have a worst case run time of (). This means that, in
the worst-case, they will end up exhaustively searching the entire space of
all coalition structures. Anytime methods can be classified into two types:
search methods.
formed by the states that can be reached in one step (of the algorithm)
from s. TS builds and handles a tabu list T of moves that are forbidden,
that is, some states that cannot be reached, unless some special conditions
reached from s if it has the minimum value that f has ever attained in the
19
Usually, a TS algorithm begins with a random state s0 and it computes
sequence of states s1, s2, s3, . . . that may improve the criterion, but can
also be worse than the previous step. It is this feature that gives TS the
capacity to avoid local optima and reach the global optimum. TS ends at a
maximum number of iterations fixed by the user, big enough to let the
handling the tabu list, and for this reason the size of T must be limited.
must be deleted from T when it is full and a new state should be put into
delete the first state in T, etc. TS has been used in many combinatorial
optimization problems.
Partitioning problems requires dividing the given set into subsets that the
20
5.2.1 Tabu seach algorithm
Algorithm:
1. Divide coalition C into two partitions c1 and c2 such that sum of values
2. Store the partition for the coalition in a search data structure like hash
table or dictionary.
3. Similarly c1 and c2 are divided recursively into two partitions such that
sum of their respective subset is maximum and their partitions are stored
coalition structure.
21
A snapshot of code:
22
Backtracking to find elements in each partition
23
Chapter 6
Our goal in this article was to provide extensive theoretical analysis of the
search space of the Complete Set Partitioning problem and to discuss upon
programming and other heuristic based approach using tabu search. Both
The choice between exact and heuristic approaches is made on the basis of
economics and these two approaches may be used to obtain the desired
results. While the focus in this article was on settings where there are no
24
Bibliography
25