Exercise 1, question 3.2

Re: Exercise 1, question 3.2

Thu, 07 Apr 2016 17:56:06 +0000

yes for all

Re: Exercise 1, question 3.2

Thu, 07 Apr 2016 15:15:10 +0000

Regarding question 3.7 -
1. By finding a strategy for a user, you mean provide an algorithm for every user (the algorithm is the same for each user) that given his own q_i picks a band?
2. Also, we want to find one strategy that satisfies all three conditions, right? rather than 3 different strategies.
3. Does the user strategy provide a mixed strategy (אסטרטגיה מעורבת) or a pure one?

Re: Exercise 1, question 3.2

Tue, 05 Apr 2016 11:16:59 +0000

just in n

Re: Exercise 1, question 3.2

Tue, 05 Apr 2016 09:14:17 +0000

Also, in question 3.6, the algorithm should be polynomial with regard to n? or the sum of all bits needed to be sent?

Re: Exercise 1, question 3.2

Mon, 04 Apr 2016 21:26:26 +0000

yes

Exercise 1, question 3.2

Mon, 04 Apr 2016 21:02:07 +0000

In the question it says - "the load on the most loaded band" - by load, do you mean the sum of all bits sent by all players who chose that band?
Thank you.