Maxit negotiations











up vote
8
down vote

favorite












Your military junta has recently overthrown the government of Malta and taken control of the small island nation. As a way to finance your wise and just dictatorship, you have decided to threaten the European government that you will invoke Maxit – Maltese exit from the union – unless they offer you a suitable monetary compensation to convince you to stay. You are currently preparing for the negotiations. In particular, you need to tell your negotiators the smallest acceptable contribution with which a deal can still be made.



You know for a fact that the union has budgeted some maximum amount that they are willing to contribute, and this amount is somewhere between zero and one hundred coffers of euro banknotes. If you ask for more than their budgeted amount, the talks will conclude immediately and no deal will be made. Unfortunately, your spies have not been able to get hold of the budget's details – from your perspective, any number between 0 and 100 is equally likely to be the union's maximum contribution.



Civilized European negotiation rules dictate that once your minimum requirement and the union's budgeted maximum have been presented, your negotiator can get the final price up to exactly halfway between those two numbers. So if your minimum acceptable number is 70 coffers and the union's budget is 80 coffers, the negotiations will eventually lead to a deal of 75 coffers.



Being a dictator, you are completely uninterested in whether the country will actually leave or stay in the union, as you care solely about the financial gain. What number should you give your negotiators as the minimum price? How large is the average contribution you can expect?










share|improve this question






















  • Are the claims and offers always a whole number of coffers, or can we operate with fractions of coffers?
    – jarnbjo
    2 days ago










  • @jarnbjo I think with fractions allowed it fits the "mathematics" tag a little better, since otherwise there's a clear brute-force solution available. Should have made that clear in the description... That said it's probably not fair to change it at this point when people have already answered both variations.
    – jafe
    yesterday

















up vote
8
down vote

favorite












Your military junta has recently overthrown the government of Malta and taken control of the small island nation. As a way to finance your wise and just dictatorship, you have decided to threaten the European government that you will invoke Maxit – Maltese exit from the union – unless they offer you a suitable monetary compensation to convince you to stay. You are currently preparing for the negotiations. In particular, you need to tell your negotiators the smallest acceptable contribution with which a deal can still be made.



You know for a fact that the union has budgeted some maximum amount that they are willing to contribute, and this amount is somewhere between zero and one hundred coffers of euro banknotes. If you ask for more than their budgeted amount, the talks will conclude immediately and no deal will be made. Unfortunately, your spies have not been able to get hold of the budget's details – from your perspective, any number between 0 and 100 is equally likely to be the union's maximum contribution.



Civilized European negotiation rules dictate that once your minimum requirement and the union's budgeted maximum have been presented, your negotiator can get the final price up to exactly halfway between those two numbers. So if your minimum acceptable number is 70 coffers and the union's budget is 80 coffers, the negotiations will eventually lead to a deal of 75 coffers.



Being a dictator, you are completely uninterested in whether the country will actually leave or stay in the union, as you care solely about the financial gain. What number should you give your negotiators as the minimum price? How large is the average contribution you can expect?










share|improve this question






















  • Are the claims and offers always a whole number of coffers, or can we operate with fractions of coffers?
    – jarnbjo
    2 days ago










  • @jarnbjo I think with fractions allowed it fits the "mathematics" tag a little better, since otherwise there's a clear brute-force solution available. Should have made that clear in the description... That said it's probably not fair to change it at this point when people have already answered both variations.
    – jafe
    yesterday















up vote
8
down vote

favorite









up vote
8
down vote

favorite











Your military junta has recently overthrown the government of Malta and taken control of the small island nation. As a way to finance your wise and just dictatorship, you have decided to threaten the European government that you will invoke Maxit – Maltese exit from the union – unless they offer you a suitable monetary compensation to convince you to stay. You are currently preparing for the negotiations. In particular, you need to tell your negotiators the smallest acceptable contribution with which a deal can still be made.



You know for a fact that the union has budgeted some maximum amount that they are willing to contribute, and this amount is somewhere between zero and one hundred coffers of euro banknotes. If you ask for more than their budgeted amount, the talks will conclude immediately and no deal will be made. Unfortunately, your spies have not been able to get hold of the budget's details – from your perspective, any number between 0 and 100 is equally likely to be the union's maximum contribution.



Civilized European negotiation rules dictate that once your minimum requirement and the union's budgeted maximum have been presented, your negotiator can get the final price up to exactly halfway between those two numbers. So if your minimum acceptable number is 70 coffers and the union's budget is 80 coffers, the negotiations will eventually lead to a deal of 75 coffers.



Being a dictator, you are completely uninterested in whether the country will actually leave or stay in the union, as you care solely about the financial gain. What number should you give your negotiators as the minimum price? How large is the average contribution you can expect?










share|improve this question













Your military junta has recently overthrown the government of Malta and taken control of the small island nation. As a way to finance your wise and just dictatorship, you have decided to threaten the European government that you will invoke Maxit – Maltese exit from the union – unless they offer you a suitable monetary compensation to convince you to stay. You are currently preparing for the negotiations. In particular, you need to tell your negotiators the smallest acceptable contribution with which a deal can still be made.



You know for a fact that the union has budgeted some maximum amount that they are willing to contribute, and this amount is somewhere between zero and one hundred coffers of euro banknotes. If you ask for more than their budgeted amount, the talks will conclude immediately and no deal will be made. Unfortunately, your spies have not been able to get hold of the budget's details – from your perspective, any number between 0 and 100 is equally likely to be the union's maximum contribution.



Civilized European negotiation rules dictate that once your minimum requirement and the union's budgeted maximum have been presented, your negotiator can get the final price up to exactly halfway between those two numbers. So if your minimum acceptable number is 70 coffers and the union's budget is 80 coffers, the negotiations will eventually lead to a deal of 75 coffers.



Being a dictator, you are completely uninterested in whether the country will actually leave or stay in the union, as you care solely about the financial gain. What number should you give your negotiators as the minimum price? How large is the average contribution you can expect?







mathematics story strategy






share|improve this question













share|improve this question











share|improve this question




share|improve this question










asked 2 days ago









jafe

12.6k29133




12.6k29133












  • Are the claims and offers always a whole number of coffers, or can we operate with fractions of coffers?
    – jarnbjo
    2 days ago










  • @jarnbjo I think with fractions allowed it fits the "mathematics" tag a little better, since otherwise there's a clear brute-force solution available. Should have made that clear in the description... That said it's probably not fair to change it at this point when people have already answered both variations.
    – jafe
    yesterday




















  • Are the claims and offers always a whole number of coffers, or can we operate with fractions of coffers?
    – jarnbjo
    2 days ago










  • @jarnbjo I think with fractions allowed it fits the "mathematics" tag a little better, since otherwise there's a clear brute-force solution available. Should have made that clear in the description... That said it's probably not fair to change it at this point when people have already answered both variations.
    – jafe
    yesterday


















Are the claims and offers always a whole number of coffers, or can we operate with fractions of coffers?
– jarnbjo
2 days ago




Are the claims and offers always a whole number of coffers, or can we operate with fractions of coffers?
– jarnbjo
2 days ago












@jarnbjo I think with fractions allowed it fits the "mathematics" tag a little better, since otherwise there's a clear brute-force solution available. Should have made that clear in the description... That said it's probably not fair to change it at this point when people have already answered both variations.
– jafe
yesterday






@jarnbjo I think with fractions allowed it fits the "mathematics" tag a little better, since otherwise there's a clear brute-force solution available. Should have made that clear in the description... That said it's probably not fair to change it at this point when people have already answered both variations.
– jafe
yesterday












4 Answers
4






active

oldest

votes

















up vote
10
down vote



accepted










You should ask for




$frac{100}3$ coffers of euros.




Suppose




you're asking for $x$ coffers of euros and considering making it $x+delta$ instead. What difference does this make? (To first order, as $deltarightarrow0$.) With probability $delta/100$ you've just gone beyond what the EU was willing to offer, and have lost $x$. And with probability $1-x/100$ you had a deal and still have one, but now you'll get $delta/2$ more. The optimal choice of $x$ will be where the gain and loss are equal, so $x/100=(1-x/100)/2$ or $x=100/3$.




In this case you will get, on average,




zero, 1/3 of the time; and 100/3 plus half the average excess, or 50, 2/3 of the time. That is, on average you will get exactly what you ask for. Perhaps there's an elegant reason why this must obviously be so when you choose optimally?




[EDITED to add:] Discussion with user Excited Raichu in comments to their answer has brought up an important point. Are we to assume that the sums of money here are continuously variable and that the EU's offer will be a uniform random quantity between 0 and 100? Or that they are integer numbers of coffers of euros (with, presumably, the possibility of splitting a coffer in half if the parity of offer and demand are different) and that the EU is equally likely to offer 0, 1, 2, ..., 100 coffers? Or something else? My answer above assumes the first of those options. The second is possibly best handled by direct computation, which (if I've done it right) leads to the conclusion




that you should ask for 34 coffers of euros, and will on average get 33.5 coffers.




Brainless Python code to deal with the discrete version of the question:



def dprofit(demand):
s = 0
for offer in range(0, 101):
if offer >= demand:
s += 0.5*(offer+demand)
return s

best = (0,0)
for demand in range(0,101):
p = dprofit(demand)
if p>best[0]: best = (p,demand)


after which




best = (3383.5, 34) and 3383.5/101 = 33.5.







share|improve this answer























  • Is that still true now that I have treated the continuous and discrete versions of the question separately?
    – Gareth McCaughan
    2 days ago










  • No, sorry. I read the question as if it was talking about a number of indivisible coffers, got a different answer than in your first part, wrote my previous comment here, realized where the mismatch was and then commented on the question asking what is actually ment.
    – jarnbjo
    2 days ago










  • Not sure how much is in a coffer, but we can rule out rot13(gung gur havba unf n znk bs mreb, vs fb gurl jbhyqa'g obgure artbgvngvat)
    – deep thought
    2 days ago










  • A 2 minute spreadsheet would confirm your computation (spoilers): i.imgur.com/aPiBcvE.png. Again assuming you can negotiate half of a coffer, rather than it always being rounded down e.g.
    – Mark Peters
    2 days ago










  • @MarkPeters Yup. The Python code also took about two minutes to write.
    – Gareth McCaughan
    2 days ago


















up vote
3
down vote













We should specify a minimum of




one coffer of euros




This average contribution we can expect is




25.75 coffers




Because




the union has a maximum between 0 and 100, uniformly distributed. Except of course we rule out 0 -- there would be no negotiation in that case, but they are sitting at the table. If 1, we get 1. If 100, we get 50.5, and the average of these is 25.75 (yes, linearity of average works here).




This is so, despite the fact that




the other answer, 33 or 34, gives us a higher average outcome. But the goal is financial gain. The assumption that 'best' means 'highest average' is called 'risk neutrality'. This assumption is valid for small sums. But a coffer of euros sounds awfully large to me. This is immediately post-coup, our military is going to have a cash flow problem and a coffer of euros sounds like a non-negligible chunk of our budget.

The average outcome is still pretty good as it is, and the prospect of increasing this somewhat clearly does not justify the risk of getting nothing at all.




The moral of this story is




to invest more in intelligence, we should have been able to get more information than that for much less than one coffer of euros.







share|improve this answer





















  • Really good approach, I love it how you are dealing explicitly with some common but unrealistic assumptions in optimization. It actually can be extended a step further, it would be optimal to ask one coffer less than what you suggest. If going that low is not permitted, then the whole negotiation is unfair in the sense that there can be a situation where your smallest allowed bid will be higher than the maximum budget - a situation which happens in many realistic negotiations, but somehow feels unsatisfying in the context of the puzzle.
    – rumtscho
    2 days ago


















up vote
2
down vote













My answer is the same as that of Gareth, but I intuited differently so I thought I'd share my solution as well. This is for the continuous case, by the way, where fractional coffers are allowed.



First, let's assume Malta chooses to demand 50 coffers, then one of two things can happen.




Either 50 coffers is less than or equal to what EU offers, or it's more. If we name Malta's offer $M$ and EU's offer $E$, then
$$mathbf{P}(M lt E) = frac{100-M}{100}$$




If 50 coffers happened to be less than what EU offered then we know that




$$E sim mathcal{U}(50, 100)$$
and
$$mathbf{E}(E) = 75$$




Expected gain in this case will therefore be




$$frac{50 +75}{2} = 62.5$$
but that's assuming EU's offer was greater than 50, and probability of that is $0.5$. Therefore, if Malta offered $50$ coffers, the expected gain is $62.5/2 = 31.25$.




With that settled we can derive a general formula for any $M$.




! With $G$ being Malta's expected gain:



! $$begin{align}
G &= frac{M + frac{M + 100}{2}}{2} cdot frac{100 - M}{100} \
&= frac{(3M + 100)(100 - M)}{400} \
&= -0.0075M^2 + 0.5M + 25
end{align}$$



! As we want to know for what $M$ we get the largest $G$, the final step is to take the first derivative and solve $G^prime = 0$



! $$ begin{align} 0 &= -0.015M + 0.5 \
M &= frac{0.5}{0.015} \
M &= frac{100}{3} end{align}$$






I also wrote a small R script to double check and draw the curve



f <- function(x, y) {
(x <= y)*(x + y)/2
}

s <- seq(0, 100, by=0.1)
m <- outer(s, s, f)
r <- rowMeans(m)
s[which.max(r)]

plot(r ~ s, type="l")
curve(-0.0075*x^2 + 0.5*x + 25, 0, 100, add=TRUE, lty=3, col=2, lwd=3)



enter image description here







share|improve this answer










New contributor




AkselA is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.














  • 1




    Obviously I have not quite figured out this spoiler thing
    – AkselA
    yesterday


















up vote
1
down vote













I actually got something a bit different from the other answer. Here's a picture of my work, please let me know if anything is wrong:




enter image description here




EDIT: After the conversation in comments, I redid it using (101-x)/101 and got the same result...




enter image description here







share|improve this answer























  • I think you want 100-x where you have 101-x. E.g., if x=100 then the probability should be 0, not 1%.
    – Gareth McCaughan
    2 days ago










  • (Even more obviously: if x=0 then you've got a probability that's >1.)
    – Gareth McCaughan
    2 days ago










  • @GarethMcCaughan wait, then we may be both wrong- there are 101 possibilities (0 to 100 inclusive)- shouldn’t it be (101-x)/101 then?
    – Excited Raichu
    2 days ago










  • I was assuming a continuously variable offer from the EU. If it's guaranteed to be an integer number of coffers then indeed things may be a bit different.
    – Gareth McCaughan
    2 days ago










  • @GarethMcCaughan actually, with (101-x)/101 my answer is the same- so it actually does depend on whether the offer must be an integer or not.
    – Excited Raichu
    2 days ago











Your Answer





StackExchange.ifUsing("editor", function () {
return StackExchange.using("mathjaxEditing", function () {
StackExchange.MarkdownEditor.creationCallbacks.add(function (editor, postfix) {
StackExchange.mathjaxEditing.prepareWmdForMathJax(editor, postfix, [["$", "$"], ["\\(","\\)"]]);
});
});
}, "mathjax-editing");

StackExchange.ready(function() {
var channelOptions = {
tags: "".split(" "),
id: "559"
};
initTagRenderer("".split(" "), "".split(" "), channelOptions);

StackExchange.using("externalEditor", function() {
// Have to fire editor after snippets, if snippets enabled
if (StackExchange.settings.snippets.snippetsEnabled) {
StackExchange.using("snippets", function() {
createEditor();
});
}
else {
createEditor();
}
});

function createEditor() {
StackExchange.prepareEditor({
heartbeatType: 'answer',
convertImagesToLinks: false,
noModals: true,
showLowRepImageUploadWarning: true,
reputationToPostImages: null,
bindNavPrevention: true,
postfix: "",
imageUploader: {
brandingHtml: "Powered by u003ca class="icon-imgur-white" href="https://imgur.com/"u003eu003c/au003e",
contentPolicyHtml: "User contributions licensed under u003ca href="https://creativecommons.org/licenses/by-sa/3.0/"u003ecc by-sa 3.0 with attribution requiredu003c/au003e u003ca href="https://stackoverflow.com/legal/content-policy"u003e(content policy)u003c/au003e",
allowUrls: true
},
noCode: true, onDemand: true,
discardSelector: ".discard-answer"
,immediatelyShowMarkdownHelp:true
});


}
});














 

draft saved


draft discarded


















StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f75337%2fmaxit-negotiations%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown

























4 Answers
4






active

oldest

votes








4 Answers
4






active

oldest

votes









active

oldest

votes






active

oldest

votes








up vote
10
down vote



accepted










You should ask for




$frac{100}3$ coffers of euros.




Suppose




you're asking for $x$ coffers of euros and considering making it $x+delta$ instead. What difference does this make? (To first order, as $deltarightarrow0$.) With probability $delta/100$ you've just gone beyond what the EU was willing to offer, and have lost $x$. And with probability $1-x/100$ you had a deal and still have one, but now you'll get $delta/2$ more. The optimal choice of $x$ will be where the gain and loss are equal, so $x/100=(1-x/100)/2$ or $x=100/3$.




In this case you will get, on average,




zero, 1/3 of the time; and 100/3 plus half the average excess, or 50, 2/3 of the time. That is, on average you will get exactly what you ask for. Perhaps there's an elegant reason why this must obviously be so when you choose optimally?




[EDITED to add:] Discussion with user Excited Raichu in comments to their answer has brought up an important point. Are we to assume that the sums of money here are continuously variable and that the EU's offer will be a uniform random quantity between 0 and 100? Or that they are integer numbers of coffers of euros (with, presumably, the possibility of splitting a coffer in half if the parity of offer and demand are different) and that the EU is equally likely to offer 0, 1, 2, ..., 100 coffers? Or something else? My answer above assumes the first of those options. The second is possibly best handled by direct computation, which (if I've done it right) leads to the conclusion




that you should ask for 34 coffers of euros, and will on average get 33.5 coffers.




Brainless Python code to deal with the discrete version of the question:



def dprofit(demand):
s = 0
for offer in range(0, 101):
if offer >= demand:
s += 0.5*(offer+demand)
return s

best = (0,0)
for demand in range(0,101):
p = dprofit(demand)
if p>best[0]: best = (p,demand)


after which




best = (3383.5, 34) and 3383.5/101 = 33.5.







share|improve this answer























  • Is that still true now that I have treated the continuous and discrete versions of the question separately?
    – Gareth McCaughan
    2 days ago










  • No, sorry. I read the question as if it was talking about a number of indivisible coffers, got a different answer than in your first part, wrote my previous comment here, realized where the mismatch was and then commented on the question asking what is actually ment.
    – jarnbjo
    2 days ago










  • Not sure how much is in a coffer, but we can rule out rot13(gung gur havba unf n znk bs mreb, vs fb gurl jbhyqa'g obgure artbgvngvat)
    – deep thought
    2 days ago










  • A 2 minute spreadsheet would confirm your computation (spoilers): i.imgur.com/aPiBcvE.png. Again assuming you can negotiate half of a coffer, rather than it always being rounded down e.g.
    – Mark Peters
    2 days ago










  • @MarkPeters Yup. The Python code also took about two minutes to write.
    – Gareth McCaughan
    2 days ago















up vote
10
down vote



accepted










You should ask for




$frac{100}3$ coffers of euros.




Suppose




you're asking for $x$ coffers of euros and considering making it $x+delta$ instead. What difference does this make? (To first order, as $deltarightarrow0$.) With probability $delta/100$ you've just gone beyond what the EU was willing to offer, and have lost $x$. And with probability $1-x/100$ you had a deal and still have one, but now you'll get $delta/2$ more. The optimal choice of $x$ will be where the gain and loss are equal, so $x/100=(1-x/100)/2$ or $x=100/3$.




In this case you will get, on average,




zero, 1/3 of the time; and 100/3 plus half the average excess, or 50, 2/3 of the time. That is, on average you will get exactly what you ask for. Perhaps there's an elegant reason why this must obviously be so when you choose optimally?




[EDITED to add:] Discussion with user Excited Raichu in comments to their answer has brought up an important point. Are we to assume that the sums of money here are continuously variable and that the EU's offer will be a uniform random quantity between 0 and 100? Or that they are integer numbers of coffers of euros (with, presumably, the possibility of splitting a coffer in half if the parity of offer and demand are different) and that the EU is equally likely to offer 0, 1, 2, ..., 100 coffers? Or something else? My answer above assumes the first of those options. The second is possibly best handled by direct computation, which (if I've done it right) leads to the conclusion




that you should ask for 34 coffers of euros, and will on average get 33.5 coffers.




Brainless Python code to deal with the discrete version of the question:



def dprofit(demand):
s = 0
for offer in range(0, 101):
if offer >= demand:
s += 0.5*(offer+demand)
return s

best = (0,0)
for demand in range(0,101):
p = dprofit(demand)
if p>best[0]: best = (p,demand)


after which




best = (3383.5, 34) and 3383.5/101 = 33.5.







share|improve this answer























  • Is that still true now that I have treated the continuous and discrete versions of the question separately?
    – Gareth McCaughan
    2 days ago










  • No, sorry. I read the question as if it was talking about a number of indivisible coffers, got a different answer than in your first part, wrote my previous comment here, realized where the mismatch was and then commented on the question asking what is actually ment.
    – jarnbjo
    2 days ago










  • Not sure how much is in a coffer, but we can rule out rot13(gung gur havba unf n znk bs mreb, vs fb gurl jbhyqa'g obgure artbgvngvat)
    – deep thought
    2 days ago










  • A 2 minute spreadsheet would confirm your computation (spoilers): i.imgur.com/aPiBcvE.png. Again assuming you can negotiate half of a coffer, rather than it always being rounded down e.g.
    – Mark Peters
    2 days ago










  • @MarkPeters Yup. The Python code also took about two minutes to write.
    – Gareth McCaughan
    2 days ago













up vote
10
down vote



accepted







up vote
10
down vote



accepted






You should ask for




$frac{100}3$ coffers of euros.




Suppose




you're asking for $x$ coffers of euros and considering making it $x+delta$ instead. What difference does this make? (To first order, as $deltarightarrow0$.) With probability $delta/100$ you've just gone beyond what the EU was willing to offer, and have lost $x$. And with probability $1-x/100$ you had a deal and still have one, but now you'll get $delta/2$ more. The optimal choice of $x$ will be where the gain and loss are equal, so $x/100=(1-x/100)/2$ or $x=100/3$.




In this case you will get, on average,




zero, 1/3 of the time; and 100/3 plus half the average excess, or 50, 2/3 of the time. That is, on average you will get exactly what you ask for. Perhaps there's an elegant reason why this must obviously be so when you choose optimally?




[EDITED to add:] Discussion with user Excited Raichu in comments to their answer has brought up an important point. Are we to assume that the sums of money here are continuously variable and that the EU's offer will be a uniform random quantity between 0 and 100? Or that they are integer numbers of coffers of euros (with, presumably, the possibility of splitting a coffer in half if the parity of offer and demand are different) and that the EU is equally likely to offer 0, 1, 2, ..., 100 coffers? Or something else? My answer above assumes the first of those options. The second is possibly best handled by direct computation, which (if I've done it right) leads to the conclusion




that you should ask for 34 coffers of euros, and will on average get 33.5 coffers.




Brainless Python code to deal with the discrete version of the question:



def dprofit(demand):
s = 0
for offer in range(0, 101):
if offer >= demand:
s += 0.5*(offer+demand)
return s

best = (0,0)
for demand in range(0,101):
p = dprofit(demand)
if p>best[0]: best = (p,demand)


after which




best = (3383.5, 34) and 3383.5/101 = 33.5.







share|improve this answer














You should ask for




$frac{100}3$ coffers of euros.




Suppose




you're asking for $x$ coffers of euros and considering making it $x+delta$ instead. What difference does this make? (To first order, as $deltarightarrow0$.) With probability $delta/100$ you've just gone beyond what the EU was willing to offer, and have lost $x$. And with probability $1-x/100$ you had a deal and still have one, but now you'll get $delta/2$ more. The optimal choice of $x$ will be where the gain and loss are equal, so $x/100=(1-x/100)/2$ or $x=100/3$.




In this case you will get, on average,




zero, 1/3 of the time; and 100/3 plus half the average excess, or 50, 2/3 of the time. That is, on average you will get exactly what you ask for. Perhaps there's an elegant reason why this must obviously be so when you choose optimally?




[EDITED to add:] Discussion with user Excited Raichu in comments to their answer has brought up an important point. Are we to assume that the sums of money here are continuously variable and that the EU's offer will be a uniform random quantity between 0 and 100? Or that they are integer numbers of coffers of euros (with, presumably, the possibility of splitting a coffer in half if the parity of offer and demand are different) and that the EU is equally likely to offer 0, 1, 2, ..., 100 coffers? Or something else? My answer above assumes the first of those options. The second is possibly best handled by direct computation, which (if I've done it right) leads to the conclusion




that you should ask for 34 coffers of euros, and will on average get 33.5 coffers.




Brainless Python code to deal with the discrete version of the question:



def dprofit(demand):
s = 0
for offer in range(0, 101):
if offer >= demand:
s += 0.5*(offer+demand)
return s

best = (0,0)
for demand in range(0,101):
p = dprofit(demand)
if p>best[0]: best = (p,demand)


after which




best = (3383.5, 34) and 3383.5/101 = 33.5.








share|improve this answer














share|improve this answer



share|improve this answer








edited 2 days ago

























answered 2 days ago









Gareth McCaughan

58.8k3147227




58.8k3147227












  • Is that still true now that I have treated the continuous and discrete versions of the question separately?
    – Gareth McCaughan
    2 days ago










  • No, sorry. I read the question as if it was talking about a number of indivisible coffers, got a different answer than in your first part, wrote my previous comment here, realized where the mismatch was and then commented on the question asking what is actually ment.
    – jarnbjo
    2 days ago










  • Not sure how much is in a coffer, but we can rule out rot13(gung gur havba unf n znk bs mreb, vs fb gurl jbhyqa'g obgure artbgvngvat)
    – deep thought
    2 days ago










  • A 2 minute spreadsheet would confirm your computation (spoilers): i.imgur.com/aPiBcvE.png. Again assuming you can negotiate half of a coffer, rather than it always being rounded down e.g.
    – Mark Peters
    2 days ago










  • @MarkPeters Yup. The Python code also took about two minutes to write.
    – Gareth McCaughan
    2 days ago


















  • Is that still true now that I have treated the continuous and discrete versions of the question separately?
    – Gareth McCaughan
    2 days ago










  • No, sorry. I read the question as if it was talking about a number of indivisible coffers, got a different answer than in your first part, wrote my previous comment here, realized where the mismatch was and then commented on the question asking what is actually ment.
    – jarnbjo
    2 days ago










  • Not sure how much is in a coffer, but we can rule out rot13(gung gur havba unf n znk bs mreb, vs fb gurl jbhyqa'g obgure artbgvngvat)
    – deep thought
    2 days ago










  • A 2 minute spreadsheet would confirm your computation (spoilers): i.imgur.com/aPiBcvE.png. Again assuming you can negotiate half of a coffer, rather than it always being rounded down e.g.
    – Mark Peters
    2 days ago










  • @MarkPeters Yup. The Python code also took about two minutes to write.
    – Gareth McCaughan
    2 days ago
















Is that still true now that I have treated the continuous and discrete versions of the question separately?
– Gareth McCaughan
2 days ago




Is that still true now that I have treated the continuous and discrete versions of the question separately?
– Gareth McCaughan
2 days ago












No, sorry. I read the question as if it was talking about a number of indivisible coffers, got a different answer than in your first part, wrote my previous comment here, realized where the mismatch was and then commented on the question asking what is actually ment.
– jarnbjo
2 days ago




No, sorry. I read the question as if it was talking about a number of indivisible coffers, got a different answer than in your first part, wrote my previous comment here, realized where the mismatch was and then commented on the question asking what is actually ment.
– jarnbjo
2 days ago












Not sure how much is in a coffer, but we can rule out rot13(gung gur havba unf n znk bs mreb, vs fb gurl jbhyqa'g obgure artbgvngvat)
– deep thought
2 days ago




Not sure how much is in a coffer, but we can rule out rot13(gung gur havba unf n znk bs mreb, vs fb gurl jbhyqa'g obgure artbgvngvat)
– deep thought
2 days ago












A 2 minute spreadsheet would confirm your computation (spoilers): i.imgur.com/aPiBcvE.png. Again assuming you can negotiate half of a coffer, rather than it always being rounded down e.g.
– Mark Peters
2 days ago




A 2 minute spreadsheet would confirm your computation (spoilers): i.imgur.com/aPiBcvE.png. Again assuming you can negotiate half of a coffer, rather than it always being rounded down e.g.
– Mark Peters
2 days ago












@MarkPeters Yup. The Python code also took about two minutes to write.
– Gareth McCaughan
2 days ago




@MarkPeters Yup. The Python code also took about two minutes to write.
– Gareth McCaughan
2 days ago










up vote
3
down vote













We should specify a minimum of




one coffer of euros




This average contribution we can expect is




25.75 coffers




Because




the union has a maximum between 0 and 100, uniformly distributed. Except of course we rule out 0 -- there would be no negotiation in that case, but they are sitting at the table. If 1, we get 1. If 100, we get 50.5, and the average of these is 25.75 (yes, linearity of average works here).




This is so, despite the fact that




the other answer, 33 or 34, gives us a higher average outcome. But the goal is financial gain. The assumption that 'best' means 'highest average' is called 'risk neutrality'. This assumption is valid for small sums. But a coffer of euros sounds awfully large to me. This is immediately post-coup, our military is going to have a cash flow problem and a coffer of euros sounds like a non-negligible chunk of our budget.

The average outcome is still pretty good as it is, and the prospect of increasing this somewhat clearly does not justify the risk of getting nothing at all.




The moral of this story is




to invest more in intelligence, we should have been able to get more information than that for much less than one coffer of euros.







share|improve this answer





















  • Really good approach, I love it how you are dealing explicitly with some common but unrealistic assumptions in optimization. It actually can be extended a step further, it would be optimal to ask one coffer less than what you suggest. If going that low is not permitted, then the whole negotiation is unfair in the sense that there can be a situation where your smallest allowed bid will be higher than the maximum budget - a situation which happens in many realistic negotiations, but somehow feels unsatisfying in the context of the puzzle.
    – rumtscho
    2 days ago















up vote
3
down vote













We should specify a minimum of




one coffer of euros




This average contribution we can expect is




25.75 coffers




Because




the union has a maximum between 0 and 100, uniformly distributed. Except of course we rule out 0 -- there would be no negotiation in that case, but they are sitting at the table. If 1, we get 1. If 100, we get 50.5, and the average of these is 25.75 (yes, linearity of average works here).




This is so, despite the fact that




the other answer, 33 or 34, gives us a higher average outcome. But the goal is financial gain. The assumption that 'best' means 'highest average' is called 'risk neutrality'. This assumption is valid for small sums. But a coffer of euros sounds awfully large to me. This is immediately post-coup, our military is going to have a cash flow problem and a coffer of euros sounds like a non-negligible chunk of our budget.

The average outcome is still pretty good as it is, and the prospect of increasing this somewhat clearly does not justify the risk of getting nothing at all.




The moral of this story is




to invest more in intelligence, we should have been able to get more information than that for much less than one coffer of euros.







share|improve this answer





















  • Really good approach, I love it how you are dealing explicitly with some common but unrealistic assumptions in optimization. It actually can be extended a step further, it would be optimal to ask one coffer less than what you suggest. If going that low is not permitted, then the whole negotiation is unfair in the sense that there can be a situation where your smallest allowed bid will be higher than the maximum budget - a situation which happens in many realistic negotiations, but somehow feels unsatisfying in the context of the puzzle.
    – rumtscho
    2 days ago













up vote
3
down vote










up vote
3
down vote









We should specify a minimum of




one coffer of euros




This average contribution we can expect is




25.75 coffers




Because




the union has a maximum between 0 and 100, uniformly distributed. Except of course we rule out 0 -- there would be no negotiation in that case, but they are sitting at the table. If 1, we get 1. If 100, we get 50.5, and the average of these is 25.75 (yes, linearity of average works here).




This is so, despite the fact that




the other answer, 33 or 34, gives us a higher average outcome. But the goal is financial gain. The assumption that 'best' means 'highest average' is called 'risk neutrality'. This assumption is valid for small sums. But a coffer of euros sounds awfully large to me. This is immediately post-coup, our military is going to have a cash flow problem and a coffer of euros sounds like a non-negligible chunk of our budget.

The average outcome is still pretty good as it is, and the prospect of increasing this somewhat clearly does not justify the risk of getting nothing at all.




The moral of this story is




to invest more in intelligence, we should have been able to get more information than that for much less than one coffer of euros.







share|improve this answer












We should specify a minimum of




one coffer of euros




This average contribution we can expect is




25.75 coffers




Because




the union has a maximum between 0 and 100, uniformly distributed. Except of course we rule out 0 -- there would be no negotiation in that case, but they are sitting at the table. If 1, we get 1. If 100, we get 50.5, and the average of these is 25.75 (yes, linearity of average works here).




This is so, despite the fact that




the other answer, 33 or 34, gives us a higher average outcome. But the goal is financial gain. The assumption that 'best' means 'highest average' is called 'risk neutrality'. This assumption is valid for small sums. But a coffer of euros sounds awfully large to me. This is immediately post-coup, our military is going to have a cash flow problem and a coffer of euros sounds like a non-negligible chunk of our budget.

The average outcome is still pretty good as it is, and the prospect of increasing this somewhat clearly does not justify the risk of getting nothing at all.




The moral of this story is




to invest more in intelligence, we should have been able to get more information than that for much less than one coffer of euros.








share|improve this answer












share|improve this answer



share|improve this answer










answered 2 days ago









deep thought

1,896523




1,896523












  • Really good approach, I love it how you are dealing explicitly with some common but unrealistic assumptions in optimization. It actually can be extended a step further, it would be optimal to ask one coffer less than what you suggest. If going that low is not permitted, then the whole negotiation is unfair in the sense that there can be a situation where your smallest allowed bid will be higher than the maximum budget - a situation which happens in many realistic negotiations, but somehow feels unsatisfying in the context of the puzzle.
    – rumtscho
    2 days ago


















  • Really good approach, I love it how you are dealing explicitly with some common but unrealistic assumptions in optimization. It actually can be extended a step further, it would be optimal to ask one coffer less than what you suggest. If going that low is not permitted, then the whole negotiation is unfair in the sense that there can be a situation where your smallest allowed bid will be higher than the maximum budget - a situation which happens in many realistic negotiations, but somehow feels unsatisfying in the context of the puzzle.
    – rumtscho
    2 days ago
















Really good approach, I love it how you are dealing explicitly with some common but unrealistic assumptions in optimization. It actually can be extended a step further, it would be optimal to ask one coffer less than what you suggest. If going that low is not permitted, then the whole negotiation is unfair in the sense that there can be a situation where your smallest allowed bid will be higher than the maximum budget - a situation which happens in many realistic negotiations, but somehow feels unsatisfying in the context of the puzzle.
– rumtscho
2 days ago




Really good approach, I love it how you are dealing explicitly with some common but unrealistic assumptions in optimization. It actually can be extended a step further, it would be optimal to ask one coffer less than what you suggest. If going that low is not permitted, then the whole negotiation is unfair in the sense that there can be a situation where your smallest allowed bid will be higher than the maximum budget - a situation which happens in many realistic negotiations, but somehow feels unsatisfying in the context of the puzzle.
– rumtscho
2 days ago










up vote
2
down vote













My answer is the same as that of Gareth, but I intuited differently so I thought I'd share my solution as well. This is for the continuous case, by the way, where fractional coffers are allowed.



First, let's assume Malta chooses to demand 50 coffers, then one of two things can happen.




Either 50 coffers is less than or equal to what EU offers, or it's more. If we name Malta's offer $M$ and EU's offer $E$, then
$$mathbf{P}(M lt E) = frac{100-M}{100}$$




If 50 coffers happened to be less than what EU offered then we know that




$$E sim mathcal{U}(50, 100)$$
and
$$mathbf{E}(E) = 75$$




Expected gain in this case will therefore be




$$frac{50 +75}{2} = 62.5$$
but that's assuming EU's offer was greater than 50, and probability of that is $0.5$. Therefore, if Malta offered $50$ coffers, the expected gain is $62.5/2 = 31.25$.




With that settled we can derive a general formula for any $M$.




! With $G$ being Malta's expected gain:



! $$begin{align}
G &= frac{M + frac{M + 100}{2}}{2} cdot frac{100 - M}{100} \
&= frac{(3M + 100)(100 - M)}{400} \
&= -0.0075M^2 + 0.5M + 25
end{align}$$



! As we want to know for what $M$ we get the largest $G$, the final step is to take the first derivative and solve $G^prime = 0$



! $$ begin{align} 0 &= -0.015M + 0.5 \
M &= frac{0.5}{0.015} \
M &= frac{100}{3} end{align}$$






I also wrote a small R script to double check and draw the curve



f <- function(x, y) {
(x <= y)*(x + y)/2
}

s <- seq(0, 100, by=0.1)
m <- outer(s, s, f)
r <- rowMeans(m)
s[which.max(r)]

plot(r ~ s, type="l")
curve(-0.0075*x^2 + 0.5*x + 25, 0, 100, add=TRUE, lty=3, col=2, lwd=3)



enter image description here







share|improve this answer










New contributor




AkselA is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.














  • 1




    Obviously I have not quite figured out this spoiler thing
    – AkselA
    yesterday















up vote
2
down vote













My answer is the same as that of Gareth, but I intuited differently so I thought I'd share my solution as well. This is for the continuous case, by the way, where fractional coffers are allowed.



First, let's assume Malta chooses to demand 50 coffers, then one of two things can happen.




Either 50 coffers is less than or equal to what EU offers, or it's more. If we name Malta's offer $M$ and EU's offer $E$, then
$$mathbf{P}(M lt E) = frac{100-M}{100}$$




If 50 coffers happened to be less than what EU offered then we know that




$$E sim mathcal{U}(50, 100)$$
and
$$mathbf{E}(E) = 75$$




Expected gain in this case will therefore be




$$frac{50 +75}{2} = 62.5$$
but that's assuming EU's offer was greater than 50, and probability of that is $0.5$. Therefore, if Malta offered $50$ coffers, the expected gain is $62.5/2 = 31.25$.




With that settled we can derive a general formula for any $M$.




! With $G$ being Malta's expected gain:



! $$begin{align}
G &= frac{M + frac{M + 100}{2}}{2} cdot frac{100 - M}{100} \
&= frac{(3M + 100)(100 - M)}{400} \
&= -0.0075M^2 + 0.5M + 25
end{align}$$



! As we want to know for what $M$ we get the largest $G$, the final step is to take the first derivative and solve $G^prime = 0$



! $$ begin{align} 0 &= -0.015M + 0.5 \
M &= frac{0.5}{0.015} \
M &= frac{100}{3} end{align}$$






I also wrote a small R script to double check and draw the curve



f <- function(x, y) {
(x <= y)*(x + y)/2
}

s <- seq(0, 100, by=0.1)
m <- outer(s, s, f)
r <- rowMeans(m)
s[which.max(r)]

plot(r ~ s, type="l")
curve(-0.0075*x^2 + 0.5*x + 25, 0, 100, add=TRUE, lty=3, col=2, lwd=3)



enter image description here







share|improve this answer










New contributor




AkselA is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.














  • 1




    Obviously I have not quite figured out this spoiler thing
    – AkselA
    yesterday













up vote
2
down vote










up vote
2
down vote









My answer is the same as that of Gareth, but I intuited differently so I thought I'd share my solution as well. This is for the continuous case, by the way, where fractional coffers are allowed.



First, let's assume Malta chooses to demand 50 coffers, then one of two things can happen.




Either 50 coffers is less than or equal to what EU offers, or it's more. If we name Malta's offer $M$ and EU's offer $E$, then
$$mathbf{P}(M lt E) = frac{100-M}{100}$$




If 50 coffers happened to be less than what EU offered then we know that




$$E sim mathcal{U}(50, 100)$$
and
$$mathbf{E}(E) = 75$$




Expected gain in this case will therefore be




$$frac{50 +75}{2} = 62.5$$
but that's assuming EU's offer was greater than 50, and probability of that is $0.5$. Therefore, if Malta offered $50$ coffers, the expected gain is $62.5/2 = 31.25$.




With that settled we can derive a general formula for any $M$.




! With $G$ being Malta's expected gain:



! $$begin{align}
G &= frac{M + frac{M + 100}{2}}{2} cdot frac{100 - M}{100} \
&= frac{(3M + 100)(100 - M)}{400} \
&= -0.0075M^2 + 0.5M + 25
end{align}$$



! As we want to know for what $M$ we get the largest $G$, the final step is to take the first derivative and solve $G^prime = 0$



! $$ begin{align} 0 &= -0.015M + 0.5 \
M &= frac{0.5}{0.015} \
M &= frac{100}{3} end{align}$$






I also wrote a small R script to double check and draw the curve



f <- function(x, y) {
(x <= y)*(x + y)/2
}

s <- seq(0, 100, by=0.1)
m <- outer(s, s, f)
r <- rowMeans(m)
s[which.max(r)]

plot(r ~ s, type="l")
curve(-0.0075*x^2 + 0.5*x + 25, 0, 100, add=TRUE, lty=3, col=2, lwd=3)



enter image description here







share|improve this answer










New contributor




AkselA is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









My answer is the same as that of Gareth, but I intuited differently so I thought I'd share my solution as well. This is for the continuous case, by the way, where fractional coffers are allowed.



First, let's assume Malta chooses to demand 50 coffers, then one of two things can happen.




Either 50 coffers is less than or equal to what EU offers, or it's more. If we name Malta's offer $M$ and EU's offer $E$, then
$$mathbf{P}(M lt E) = frac{100-M}{100}$$




If 50 coffers happened to be less than what EU offered then we know that




$$E sim mathcal{U}(50, 100)$$
and
$$mathbf{E}(E) = 75$$




Expected gain in this case will therefore be




$$frac{50 +75}{2} = 62.5$$
but that's assuming EU's offer was greater than 50, and probability of that is $0.5$. Therefore, if Malta offered $50$ coffers, the expected gain is $62.5/2 = 31.25$.




With that settled we can derive a general formula for any $M$.




! With $G$ being Malta's expected gain:



! $$begin{align}
G &= frac{M + frac{M + 100}{2}}{2} cdot frac{100 - M}{100} \
&= frac{(3M + 100)(100 - M)}{400} \
&= -0.0075M^2 + 0.5M + 25
end{align}$$



! As we want to know for what $M$ we get the largest $G$, the final step is to take the first derivative and solve $G^prime = 0$



! $$ begin{align} 0 &= -0.015M + 0.5 \
M &= frac{0.5}{0.015} \
M &= frac{100}{3} end{align}$$






I also wrote a small R script to double check and draw the curve



f <- function(x, y) {
(x <= y)*(x + y)/2
}

s <- seq(0, 100, by=0.1)
m <- outer(s, s, f)
r <- rowMeans(m)
s[which.max(r)]

plot(r ~ s, type="l")
curve(-0.0075*x^2 + 0.5*x + 25, 0, 100, add=TRUE, lty=3, col=2, lwd=3)



enter image description here








share|improve this answer










New contributor




AkselA is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









share|improve this answer



share|improve this answer








edited yesterday





















New contributor




AkselA is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.









answered yesterday









AkselA

1213




1213




New contributor




AkselA is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.





New contributor





AkselA is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.






AkselA is a new contributor to this site. Take care in asking for clarification, commenting, and answering.
Check out our Code of Conduct.








  • 1




    Obviously I have not quite figured out this spoiler thing
    – AkselA
    yesterday














  • 1




    Obviously I have not quite figured out this spoiler thing
    – AkselA
    yesterday








1




1




Obviously I have not quite figured out this spoiler thing
– AkselA
yesterday




Obviously I have not quite figured out this spoiler thing
– AkselA
yesterday










up vote
1
down vote













I actually got something a bit different from the other answer. Here's a picture of my work, please let me know if anything is wrong:




enter image description here




EDIT: After the conversation in comments, I redid it using (101-x)/101 and got the same result...




enter image description here







share|improve this answer























  • I think you want 100-x where you have 101-x. E.g., if x=100 then the probability should be 0, not 1%.
    – Gareth McCaughan
    2 days ago










  • (Even more obviously: if x=0 then you've got a probability that's >1.)
    – Gareth McCaughan
    2 days ago










  • @GarethMcCaughan wait, then we may be both wrong- there are 101 possibilities (0 to 100 inclusive)- shouldn’t it be (101-x)/101 then?
    – Excited Raichu
    2 days ago










  • I was assuming a continuously variable offer from the EU. If it's guaranteed to be an integer number of coffers then indeed things may be a bit different.
    – Gareth McCaughan
    2 days ago










  • @GarethMcCaughan actually, with (101-x)/101 my answer is the same- so it actually does depend on whether the offer must be an integer or not.
    – Excited Raichu
    2 days ago















up vote
1
down vote













I actually got something a bit different from the other answer. Here's a picture of my work, please let me know if anything is wrong:




enter image description here




EDIT: After the conversation in comments, I redid it using (101-x)/101 and got the same result...




enter image description here







share|improve this answer























  • I think you want 100-x where you have 101-x. E.g., if x=100 then the probability should be 0, not 1%.
    – Gareth McCaughan
    2 days ago










  • (Even more obviously: if x=0 then you've got a probability that's >1.)
    – Gareth McCaughan
    2 days ago










  • @GarethMcCaughan wait, then we may be both wrong- there are 101 possibilities (0 to 100 inclusive)- shouldn’t it be (101-x)/101 then?
    – Excited Raichu
    2 days ago










  • I was assuming a continuously variable offer from the EU. If it's guaranteed to be an integer number of coffers then indeed things may be a bit different.
    – Gareth McCaughan
    2 days ago










  • @GarethMcCaughan actually, with (101-x)/101 my answer is the same- so it actually does depend on whether the offer must be an integer or not.
    – Excited Raichu
    2 days ago













up vote
1
down vote










up vote
1
down vote









I actually got something a bit different from the other answer. Here's a picture of my work, please let me know if anything is wrong:




enter image description here




EDIT: After the conversation in comments, I redid it using (101-x)/101 and got the same result...




enter image description here







share|improve this answer














I actually got something a bit different from the other answer. Here's a picture of my work, please let me know if anything is wrong:




enter image description here




EDIT: After the conversation in comments, I redid it using (101-x)/101 and got the same result...




enter image description here








share|improve this answer














share|improve this answer



share|improve this answer








edited 2 days ago

























answered 2 days ago









Excited Raichu

3,992747




3,992747












  • I think you want 100-x where you have 101-x. E.g., if x=100 then the probability should be 0, not 1%.
    – Gareth McCaughan
    2 days ago










  • (Even more obviously: if x=0 then you've got a probability that's >1.)
    – Gareth McCaughan
    2 days ago










  • @GarethMcCaughan wait, then we may be both wrong- there are 101 possibilities (0 to 100 inclusive)- shouldn’t it be (101-x)/101 then?
    – Excited Raichu
    2 days ago










  • I was assuming a continuously variable offer from the EU. If it's guaranteed to be an integer number of coffers then indeed things may be a bit different.
    – Gareth McCaughan
    2 days ago










  • @GarethMcCaughan actually, with (101-x)/101 my answer is the same- so it actually does depend on whether the offer must be an integer or not.
    – Excited Raichu
    2 days ago


















  • I think you want 100-x where you have 101-x. E.g., if x=100 then the probability should be 0, not 1%.
    – Gareth McCaughan
    2 days ago










  • (Even more obviously: if x=0 then you've got a probability that's >1.)
    – Gareth McCaughan
    2 days ago










  • @GarethMcCaughan wait, then we may be both wrong- there are 101 possibilities (0 to 100 inclusive)- shouldn’t it be (101-x)/101 then?
    – Excited Raichu
    2 days ago










  • I was assuming a continuously variable offer from the EU. If it's guaranteed to be an integer number of coffers then indeed things may be a bit different.
    – Gareth McCaughan
    2 days ago










  • @GarethMcCaughan actually, with (101-x)/101 my answer is the same- so it actually does depend on whether the offer must be an integer or not.
    – Excited Raichu
    2 days ago
















I think you want 100-x where you have 101-x. E.g., if x=100 then the probability should be 0, not 1%.
– Gareth McCaughan
2 days ago




I think you want 100-x where you have 101-x. E.g., if x=100 then the probability should be 0, not 1%.
– Gareth McCaughan
2 days ago












(Even more obviously: if x=0 then you've got a probability that's >1.)
– Gareth McCaughan
2 days ago




(Even more obviously: if x=0 then you've got a probability that's >1.)
– Gareth McCaughan
2 days ago












@GarethMcCaughan wait, then we may be both wrong- there are 101 possibilities (0 to 100 inclusive)- shouldn’t it be (101-x)/101 then?
– Excited Raichu
2 days ago




@GarethMcCaughan wait, then we may be both wrong- there are 101 possibilities (0 to 100 inclusive)- shouldn’t it be (101-x)/101 then?
– Excited Raichu
2 days ago












I was assuming a continuously variable offer from the EU. If it's guaranteed to be an integer number of coffers then indeed things may be a bit different.
– Gareth McCaughan
2 days ago




I was assuming a continuously variable offer from the EU. If it's guaranteed to be an integer number of coffers then indeed things may be a bit different.
– Gareth McCaughan
2 days ago












@GarethMcCaughan actually, with (101-x)/101 my answer is the same- so it actually does depend on whether the offer must be an integer or not.
– Excited Raichu
2 days ago




@GarethMcCaughan actually, with (101-x)/101 my answer is the same- so it actually does depend on whether the offer must be an integer or not.
– Excited Raichu
2 days ago


















 

draft saved


draft discarded



















































 


draft saved


draft discarded














StackExchange.ready(
function () {
StackExchange.openid.initPostLogin('.new-post-login', 'https%3a%2f%2fpuzzling.stackexchange.com%2fquestions%2f75337%2fmaxit-negotiations%23new-answer', 'question_page');
}
);

Post as a guest















Required, but never shown





















































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown

































Required, but never shown














Required, but never shown












Required, but never shown







Required, but never shown







Popular posts from this blog

flock() on closed filehandle LOCK_FILE at /usr/bin/apt-mirror

Mangá

 ⁒  ․,‪⁊‑⁙ ⁖, ⁇‒※‌, †,⁖‗‌⁝    ‾‸⁘,‖⁔⁣,⁂‾
”‑,‥–,‬ ,⁀‹⁋‴⁑ ‒ ,‴⁋”‼ ⁨,‷⁔„ ‰′,‐‚ ‥‡‎“‷⁃⁨⁅⁣,⁔
⁇‘⁔⁡⁏⁌⁡‿‶‏⁨ ⁣⁕⁖⁨⁩⁥‽⁀  ‴‬⁜‟ ⁃‣‧⁕‮ …‍⁨‴ ⁩,⁚⁖‫ ,‵ ⁀,‮⁝‣‣ ⁑  ⁂– ․, ‾‽ ‏⁁“⁗‸ ‾… ‹‡⁌⁎‸‘ ‡⁏⁌‪ ‵⁛ ‎⁨ ―⁦⁤⁄⁕