BEGIN:VCALENDAR
VERSION:2.0
PRODID:ILLC Website
X-WR-TIMEZONE:Europe/Amsterdam
BEGIN:VTIMEZONE
TZID:Europe/Amsterdam
X-LIC-LOCATION:Europe/Amsterdam
BEGIN:DAYLIGHT
TZOFFSETFROM:+0100
TZOFFSETTO:+0200
TZNAME:CEST
DTSTART:19700329T020000
RRULE:FREQ=YEARLY;BYMONTH=3;BYDAY=-1SU
END:DAYLIGHT
BEGIN:STANDARD
TZOFFSETFROM:+0200
TZOFFSETTO:+0100
TZNAME:CET
DTSTART:19701025T030000
RRULE:FREQ=YEARLY;BYMONTH=10;BYDAY=-1SU
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
UID:/NewsandEvents/Archives/2005/newsitem/1098/1-D
 ecember-2005-Computational-Social-Choice-Seminar-K
 rzysztof-Apt
DTSTAMP:20051127T000000
SUMMARY:Computational Social Choice Seminar, Krzys
 ztof Apt
ATTENDEE;ROLE=Speaker:Krzysztof Apt
DTSTART;TZID=Europe/Amsterdam:20051201T160000
DTEND;TZID=Europe/Amsterdam:20051201T000000
LOCATION:Room P1.14, Euclides Building, Plantage M
 uidergracht 24, Amsterdam
DESCRIPTION:We provide elementary and uniform proo
 fs of order independence for various strategy elim
 ination procedures for finite strategic games, bot
 h for dominance by pure and by mixed strategies. T
 he proofs follow the same pattern and focus on the
  structural properties of the dominance relations.
  They rely on Newman's Lemma and related results o
 n the abstract reduction systems.   The talk is an
  account of the following article: K.R. Apt, ``Uni
 form Proofs of Order Independence for Various Stra
 tegy Elimination Procedures'', Contributions to Th
 eoretical Economics, 4(1), Article 5, 48 pages, ht
 tp://xxx.lanl.gov/abs/cs.GT/0403024.    For more i
 nformation, please contact Ulle Endriss (ulle at i
 llc.uva.nl).
X-ALT-DESC;FMTTYPE=text/html:\n      <p>\n        
 We provide elementary and uniform proofs of order 
 independence for various strategy elimination proc
 edures for finite strategic games, both for domina
 nce by pure and by mixed strategies.  The proofs f
 ollow the same pattern and focus on the structural
  properties of the dominance relations. They rely 
 on Newman's Lemma and related results on the abstr
 act reduction systems.\n      </p>\n      <p>The t
 alk is an account of the following article: K.R. A
 pt, ``Uniform Proofs of Order Independence for Var
 ious Strategy Elimination Procedures'', Contributi
 ons to Theoretical Economics, 4(1), Article 5, 48 
 pages, <a target="_blank" href="http://xxx.lanl.go
 v/abs/cs.GT/0403024">http://xxx.lanl.gov/abs/cs.GT
 /0403024</a>.\n      </p>\n    \n      <p>\n      
   For more information, please contact Ulle Endris
 s (<a class="email">ulle <span class="at">at</span
 > illc.uva.nl</a>).\n      </p>\n    
URL:/NewsandEvents/Archives/2005/newsitem/1098/1-D
 ecember-2005-Computational-Social-Choice-Seminar-K
 rzysztof-Apt
END:VEVENT
END:VCALENDAR
