<?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; algorithm</title>
	<atom:link href="http://blog.yhuang.org/?feed=rss2&#038;tag=algorithm" 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>algorithm for common goods cost sharing</title>
		<link>https://blog.yhuang.org/?p=259</link>
		<comments>https://blog.yhuang.org/?p=259#comments</comments>
		<pubDate>Fri, 09 Apr 2010 03:16:39 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[algorithms]]></category>
		<category><![CDATA[common goods]]></category>
		<category><![CDATA[coordination]]></category>
		<category><![CDATA[cost]]></category>
		<category><![CDATA[differentials]]></category>
		<category><![CDATA[good]]></category>
		<category><![CDATA[roommate situation]]></category>
		<category><![CDATA[unit]]></category>

		<guid isPermaLink="false">http://scripts.mit.edu/~zong/wpress/?p=259</guid>
		<description><![CDATA[In situations where the cost of common goods or utilities is shared, such as the roommate situation, usually several algorithms are used. Sometimes people take turns bearing the cost of new purchases or renewals. Sometimes people split the cost per head. These are more convenient and efficient than each person acquiring a copy of such [...]]]></description>
			<content:encoded><![CDATA[<p>In situations where the cost of common goods or utilities is shared, such as the roommate situation, usually several algorithms are used. Sometimes people take turns bearing the cost of new purchases or renewals. Sometimes people split the cost per head. These are more convenient and efficient than each person acquiring a copy of such goods for oneself. But it isn&#8217;t necessarily fair due to usage differentials, although people tend to live with it.</p>
<p>It just occurred to me that a perfectly fair and distributed algorithm is for the person who happens to exhaust a unit quantity of a common good to replace it with a new unit, at own cost. This shares cost proportional to actual use (probabilistically), but doesn&#8217;t require any coordination or accounting.</p>
]]></content:encoded>
			<wfw:commentRss>https://blog.yhuang.org/?feed=rss2&#038;p=259</wfw:commentRss>
		<slash:comments>0</slash:comments>
		</item>
		<item>
		<title>elevators</title>
		<link>https://blog.yhuang.org/?p=214</link>
		<comments>https://blog.yhuang.org/?p=214#comments</comments>
		<pubDate>Tue, 20 Oct 2009 19:09:57 +0000</pubDate>
		<dc:creator>admin</dc:creator>
				<category><![CDATA[Uncategorized]]></category>
		<category><![CDATA[algorithm]]></category>
		<category><![CDATA[button]]></category>
		<category><![CDATA[elevator]]></category>
		<category><![CDATA[elevator buttons]]></category>
		<category><![CDATA[elevators]]></category>
		<category><![CDATA[mistake]]></category>
		<category><![CDATA[toggle]]></category>
		<category><![CDATA[toggle buttons]]></category>

		<guid isPermaLink="false">http://scripts.mit.edu/~zong/wpress/?p=214</guid>
		<description><![CDATA[I wonder why elevator buttons aren&#8217;t toggle buttons&#8230; Many a time the wrong button is pressed and the elevator must then take the extra time to stop, when cancelling the mistake would have been quick and efficient. This has got me thinking about elevator algorithms (i.e. real elevator algorithms, not the elevator algorithm).]]></description>
			<content:encoded><![CDATA[<p>I wonder why elevator buttons aren&#8217;t toggle buttons&#8230; Many a time the wrong button is pressed and the elevator must then take the extra time to stop, when cancelling the mistake would have been quick and efficient.</p>
<p>This has got me thinking about elevator algorithms (i.e. <a href="http://www.collisiondetection.net/mt/archives/2006/01/_a_few_months_a.php">real elevator</a> algorithms, not the <a href="http://en.wikipedia.org/wiki/Elevator_algorithm">elevator algorithm</a>).</p>
]]></content:encoded>
			<wfw:commentRss>https://blog.yhuang.org/?feed=rss2&#038;p=214</wfw:commentRss>
		<slash:comments>1</slash:comments>
		</item>
	</channel>
</rss>
