31–40 of 113 posts
Tangential: can somebody explain to me how same-sex speed-dating is sequenced? Two-sex is easy as one sex remains static while the other rotates around, but I can't figure out a solution for single-sex. Update: a solution that satisfies being practical to organise and that lets you talk to all participants Update2: http://math.stackexchange.com/questions/55439/gay-speed-dati...
Tangential: can somebody explain to me how same-sex speed-dating is sequenced? Two-sex is easy as one sex remains static while the other rotates around, but I can't figure out a solution for single-sex. Update: a solution that satisfies being practical to organise and that lets you talk to all participants Update2: http://math.stackexchange.com/questions/55439/gay-speed-dati...
Tangential: can somebody explain to me how same-sex speed-dating is sequenced? Two-sex is easy as one sex remains static while the other rotates around, but I can't figure out a solution for single-sex. Update: a solution that satisfies being practical to organise and that lets you talk to all participants Update2: http://math.stackexchange.com/questions/55439/gay-speed-dati...
Tangential: can somebody explain to me how same-sex speed-dating is sequenced? Two-sex is easy as one sex remains static while the other rotates around, but I can't figure out a solution for single-sex. Update: a solution that satisfies being practical to organise and that lets you talk to all participants Update2: http://math.stackexchange.com/questions/55439/gay-speed-dati...
A solution: everyone is sequentially numbered. Evens rotate left one round, odds rotate right the next round. That way everyone has to move the same amount (assuming an even number of participants).
Tangential: can somebody explain to me how same-sex speed-dating is sequenced? Two-sex is easy as one sex remains static while the other rotates around, but I can't figure out a solution for single-sex. Update: a solution that satisfies being practical to organise and that lets you talk to all participants Update2: http://math.stackexchange.com/questions/55439/gay-speed-dati...
You divide the people into two groups arbitrarily.
> Unfortunately, this protocol is completely dependent on the trustworthiness of Trent, as they receive all of Alice and Bob’s information and are entirely free to manipulate the results of the protocol. If Trent has been compromised, perhaps by a nation-state adversary, Alice and Bob’s love life will be completely in the hands of a malicious attacker Beautifully done.
Tangential: can somebody explain to me how same-sex speed-dating is sequenced? Two-sex is easy as one sex remains static while the other rotates around, but I can't figure out a solution for single-sex. Update: a solution that satisfies being practical to organise and that lets you talk to all participants Update2: http://math.stackexchange.com/questions/55439/gay-speed-dati...
I don't know how they actually do it, but this would work: https://en.wikipedia.org/wiki/Graph_factorization#Complete_g...
> In his presentation of the original protocol, Aaronson suggests that zero-knowledge proofs can be used to prevent cheating. However, we find this approach unsatisfying, partly because zero-knowledge proofs would make the protocol much more unwieldy and time-consuming, and partly because we have no clue how to actually implement ZKP in this context I am in love with the honesty in this.
As is noted in [1], if Alice simply suggests to Bob that
they carry out a SENPAI exchange, this in and of itself is
indicative of interest on Alice’s part. Thus, the only nonawkward
way to actually use the SENPAI protocol is to
assemble large groups of people, and have every pair of
people carry out the protocol.