Thanks for the comment! On the point of making this information more well-known, is there an easy way to do so, given that I have very little familiarity with these communities?
Showing endogenous CQF is (in)efficient under complete information sounds relatively easy, right? I would love it if someone did this or explained why my intuition about hardness is wrong!
I haven’t tried it, and it could turn out to be quite easy, but I think it’s probably not so trivial to prove the result either way.
Have you considered contacting the authors of the original QF paper? Glenn and Vitalik seem quite approachable. You could also post the paper on the RxC discord or (if you’re willing to go for a high-effort alternative) submit it to their next conference.
Thanks for the comment! On the point of making this information more well-known, is there an easy way to do so, given that I have very little familiarity with these communities?
I haven’t tried it, and it could turn out to be quite easy, but I think it’s probably not so trivial to prove the result either way.
Have you considered contacting the authors of the original QF paper? Glenn and Vitalik seem quite approachable. You could also post the paper on the RxC discord or (if you’re willing to go for a high-effort alternative) submit it to their next conference.