Answered step by step
Verified Expert Solution
Link Copied!

Question

1 Approved Answer

Prove NP complete and NP hard problems 2. We consider the allocation of m indivisible items to n agents, in order to maximize the sum

Prove NP complete and NP hard problems

image text in transcribed

2. We consider the allocation of m indivisible items to n agents, in order to maximize the sum of valuations (a) Suppose each agent i is interested in precisely one subset Si of the m items; her value for Si or any superset of S isv20, and her value for any other set of items is 0. Given all the Si's and vy's as input, show that an allocation T T that maximizes the total values is NP-hard to compute. (By total value we mean the sum of the agents' values for their allocated subsets.) (b) Suppose each agent i has value vij) for each item j, and then for any subset Si her value is min( jess(j), Bi}, where Bi can be seen as some budget. Given all vi(j)'s and Bi's as input, show that an allocation Ti,-.. ,Tn that maximizes the total values is NP-hard to compute

Step by Step Solution

There are 3 Steps involved in it

Step: 1

blur-text-image

Get Instant Access to Expert-Tailored Solutions

See step-by-step solutions with expert insights and AI powered tools for academic success

Step: 2

blur-text-image_2

Step: 3

blur-text-image_3

Ace Your Homework with AI

Get the answers you need in no time with our AI-driven, step-by-step assistance

Get Started

Recommended Textbook for

Visual Basic 4 Ole Database And Controls Superbible

Authors: Michael Hatmaker, C. Woody Butler, Ibrahim Malluf, Bill Potter

1st Edition

1571690077, 978-1571690074

More Books

Students also viewed these Databases questions