<?xml version="1.0" encoding="UTF-8"?>
<rss version="2.0"
	xmlns:content="http://purl.org/rss/1.0/modules/content/"
	xmlns:wfw="http://wellformedweb.org/CommentAPI/"
	xmlns:dc="http://purl.org/dc/elements/1.1/"
	xmlns:atom="http://www.w3.org/2005/Atom"
	xmlns:sy="http://purl.org/rss/1.0/modules/syndication/"
	xmlns:slash="http://purl.org/rss/1.0/modules/slash/"
	>

<channel>
	<title>Some stuff &#187; nobody</title>
	<atom:link href="http://blog.yhuang.org/?feed=rss2&#038;tag=nobody" rel="self" type="application/rss+xml" />
	<link>https://blog.yhuang.org</link>
	<description>here.</description>
	<lastBuildDate>Wed, 27 Aug 2025 08:50:58 +0000</lastBuildDate>
	<language>en</language>
	<sy:updatePeriod>hourly</sy:updatePeriod>
	<sy:updateFrequency>1</sy:updateFrequency>
	<generator>http://wordpress.org/?v=3.1.1</generator>
		<item>
		<title>nchoosetwo and collaborative ranking</title>
		<link>https://blog.yhuang.org/?p=304</link>
		<comments>https://blog.yhuang.org/?p=304#comments</comments>
		<pubDate>Tue, 01 Feb 2011 17:55:02 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[antisocial behavior]]></category>
		<category><![CDATA[binom]]></category>
		<category><![CDATA[collaborative filtering]]></category>
		<category><![CDATA[graph data]]></category>
		<category><![CDATA[harvard students]]></category>
		<category><![CDATA[idea]]></category>
		<category><![CDATA[nchoosetwo]]></category>
		<category><![CDATA[nobody]]></category>
		<category><![CDATA[serial nature]]></category>
		<category><![CDATA[site]]></category>

		<guid isPermaLink="false">http://allegro.mit.edu/~zong/wpress/?p=304</guid>
		<description><![CDATA[Walking around campus these days, there are cryptic-looking things like and obviously referring to a dating site &#8212; currently it&#8217;s restricted to MIT and Harvard students. This one tries on an idea that I&#8217;ve heard discussed numerous times in different contexts, but apparently nobody went and did it in all these years. Instead of running [...]]]></description>
			<content:encoded><![CDATA[<p>Walking around campus these days, there are cryptic-looking things like</p>
\(\binom{n}{2}\mathrm{.com}\) and \(\binom{n}{2} \ni \binom{i}{u}\)
<p>obviously referring to a dating site &#8212; currently it&#8217;s restricted to MIT and Harvard students. This one tries on an idea that I&#8217;ve heard discussed numerous times in different contexts, but apparently nobody went and did it in all these years. Instead of running a matching algorithm, it asks third parties (i.e. matchmakers) as well as the interested parties themselves to suggest matches. The thing that is supposed to keep this low-risk is anonymity: a match isn&#8217;t revealed until the two primary parties involved mutually accept or their lists intersect.</p>
<p>As with all things that involve anonymity, this asks for trollish and antisocial behavior. I&#8217;ve already registered three aliases on moira for exactly this purpose &#8212; ok, ok, so they&#8217;ve suppressed that antic after people raised concerns, though these and other ramifications should have perhaps been worked through a bit more carefully pre-launch.</p>
<p>The spam potential remains. A matchmaker&#8217;s identity isn&#8217;t revealed unless both people accept her suggestion, so pranks and insults can be conducted to an extent. One way around this may be grafting social graph data onto the system for collaborative filtering (if they manage to obtain such data&#8230;). And if they do, perhaps the suggestions of more closely related people should weigh more, along with those of successful matchmakers. Perhaps there should even be more weight if <em>multiple</em> matchmakers concur. This is extremely intriguing, because eliminating spam is equivalent to predicting who is a likely match, and collaborative filtering for this problem is an unexplored direction.</p>
<p>The more fundamental question is why such a site is even necessary.<br />
<span id="more-304"></span><br />
Ostensibly, there is a gain over the serial nature of asking in person, due to the ability to make more <em>informative</em> decisions by using data you don&#8217;t have or cannot socially obtain in the open. If anonymity compels people to provide more preference information into the system than they would otherwise do, then everybody is better off. This is the positive aspect.</p>
<p>Nevertheless, if we wanted to use full information, why not run a global algorithm? If humans had no feelings, they could just make a list ranking whom they liked in order, and let a computer take care of allocation, almost like housing assignments. But alas, despite the rationality and efficiency of this obvious method, real humans appreciate neither the results nor the implications of it. Nobody likes to ponder the idea of not being #1. So something like nchoosetwo is a compromise, and hides the negative aspect of knowing too much: hurt feelings. But now the site becomes very dangerous. Under the cover of anonymity, the site is collecting ranking information about people from every action on the site. One particular situation in which an explicit rank order is elicited is where there are multiple matches. By your choice, you reveal to the system that &#8220;A is better than B.&#8221; Is this something the site should know? Not to mention that proposing matches in parallel, when combined with side information from the subsequently unfolding real world, also leaks preference information to an anonymous matchmaker. Those are much more dangerous information than who your Facebook friends are&#8230;</p>
<p>So far though, this site has embarrassingly few features. When you have a mutual match, all it does is to print:</p>
<blockquote><p>Mutual crush! How about a date? <img src='https://blog.yhuang.org/wp-includes/images/smilies/icon_wink.gif' alt=';-)' class='wp-smiley' /> </p></blockquote>
<p>Tellingly, you can&#8217;t remove this.</p>
]]></content:encoded>
			<wfw:commentRss>https://blog.yhuang.org/?feed=rss2&#038;p=304</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>Csiszar &amp; Korner</title>
		<link>https://blog.yhuang.org/?p=9</link>
		<comments>https://blog.yhuang.org/?p=9#comments</comments>
		<pubDate>Mon, 30 Oct 2006 18:37:27 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[chip foundry]]></category>
		<category><![CDATA[Coding]]></category>
		<category><![CDATA[ebay]]></category>
		<category><![CDATA[hungarian names]]></category>
		<category><![CDATA[janos korner]]></category>
		<category><![CDATA[kazoo books]]></category>
		<category><![CDATA[list]]></category>
		<category><![CDATA[nobody]]></category>
		<category><![CDATA[PDF]]></category>
		<category><![CDATA[press]]></category>

		<guid isPermaLink="false">http://scripts.mit.edu/~zong/wpress/?p=9</guid>
		<description><![CDATA[Imre Csiszar and Janos Korner are two Hungarians with very Hungarian names. But more importantly, they wrote a thrilling page-turner called, Information Theory: Coding Theorems for Discrete Memoryless Systems. It is a book most difficult to obtain. It seems that the book has been out of print ever since the day it was in print. Academiai Kiado [...]]]></description>
			<content:encoded><![CDATA[<p>Imre Csiszar and Janos Korner are two Hungarians with very Hungarian names. But more importantly, they wrote a thrilling page-turner called, <strong>Information Theory: Coding Theorems for Discrete Memoryless Systems</strong>. It is a book most difficult to obtain. It seems that the book has been <em>out </em>of print ever since the day it was <em>in</em> print. Academiai Kiado of Budapest and Academic Press of New York (same thing?), I&#8217;m looking in your general direction(s). Hmm. I wonder if the cost structure of running a printing press is akin to that of running a chip foundry?</p>
<p><img src="wp-content/uploads/images/9630574403.01._AA240_SCLZZZZZZZ_.gif" alt="http://ec1.images-amazon.com/images/P/9630574403.01._AA240_SCLZZZZZZZ_.gif" align="right"/></p>
<p>Anyway, forget the publishers. There is one copy in the library, permanently checked out, on hold, or requested. Almost never seen in online stores, it sells for several times the list price when scalper123 occasionally trots it out on YahooMazonBay. Worst of all, nobody has bothered to make and distribute a pdf of it for the good of the masses. Er, wait, I mean, nobody has bothered to make a Fair Use copy for <em>personal</em> use.</p>
<p>And accidentally leave the pdf on an unprotected public server. (Please?)</p>
<p>Well, that was last week, and this is now. I am to this day amazed that <a href="http://www.kazoobooks.com/">Kazoo Books</a> still had one (1) old, used, but perfectly good copy <em>at list price</em>. I wrote &#8220;had.&#8221; Good service and fast delivery, too. No fraud committed against me despite there being a phone transaction with a credit card. Highly recommend. Wait, this isn&#8217;t eBay, why am I writing this?</p>
]]></content:encoded>
			<wfw:commentRss>https://blog.yhuang.org/?feed=rss2&#038;p=9</wfw:commentRss>
		<slash:comments>3</slash:comments>
		</item>
	</channel>
</rss>
