<?xml version="1.0" encoding="UTF-8" ?>
<rss version="2.0" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:wikidot="http://www.wikidot.com/rss-namespace">

	<channel>
		<title>questions about lecture 2</title>
		<link>http://agttau-2016.wikidot.com/forum/t-1709574/questions-about-lecture-2</link>
		<description>Posts in the discussion thread &quot;questions about lecture 2&quot;</description>
				<copyright></copyright>
		<lastBuildDate>Tue, 19 May 2026 07:17:58 +0000</lastBuildDate>
		
					<item>
				<guid>http://agttau-2016.wikidot.com/forum/t-1709574#post-2508965</guid>
				<title>questions about lecture 2</title>
				<link>http://agttau-2016.wikidot.com/forum/t-1709574/questions-about-lecture-2#post-2508965</link>
				<description></description>
				<pubDate>Sat, 14 May 2016 20:43:57 +0000</pubDate>
				<wikidot:authorName>msh5746</wikidot:authorName>				<wikidot:authorUserId>2742141</wikidot:authorUserId>				<content:encoded>
					<![CDATA[
						 <p>1. What is the meaning of s_i and r_j at the of page 1 and at the beginning of page 2?<br /> 2. How problems (2) and (2') (pages 2-3) are considered to be LP? In standard LP problems the value we are trying to minimize/maximize is the dot product of the variables vector with some constant vector.<br /> 3. Does the corollary that <em>&quot;It is possible to compute a NE in polynomial time for every Zero-Sum game&quot;</em> (cor' 8 page 4) refers to 2-players games only? or to any amount of players?</p> 
				 	]]>
				</content:encoded>							</item>
				</channel>
</rss>