The article Cryptographic Protocols with Everyday Objects by James Heather, Steve Schneider, and Vanessa Teague describes the following dating protocol (due to Bert den Boer):
Alice and Bob wish to determine whether they both want to go on a date; but they want to avoid the embarrassing situation in which one of them does not want to go on a date, but knows that the other would have liked to do so. Essentially they need a two-player veto protocol: they want to compute whether at least one has vetoed the date, without revealing any further information.
Q: Bennett’s solution uses playing cards. Does this problem admits cryptographic solution?
Of course it can be reduced to Yao's Millionaires' Problem. But probably this problem has a simpler solution.