Arrow s Impossibility Theorem
|
|
- Nicholas Mills
- 6 years ago
- Views:
Transcription
1 Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1
2 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties 4 Arrow s Theorem Arrow s Impossiility Theorem Leture 12, Slide 2
3 Rep Fun Gme Properties Arrow s Theorem Ex-post expeted utility Definition (Ex-post expeted utility) Agent i s ex-post expeted utility in Byesin gme (N, A, Θ, p, u), where the gents strtegies re given y s nd the gent types re given y θ, is defined s EU i (s, θ) = A j N s j ( j θ j ) u i (, θ). The only unertinty here onerns the other gents mixed strtegies, sine i knows everyone s type. Arrow s Impossiility Theorem Leture 12, Slide 3
4 Rep Fun Gme Properties Arrow s Theorem Ex-interim expeted utility Definition (Ex-interim expeted utility) Agent i s ex-interim expeted utility in Byesin gme (N, A, Θ, p, u), where i s type is θ i nd where the gents strtegies re given y the mixed strtegy profile s, is defined s EU i (s θ i ) = p(θ i θ i ) s j ( j θ j ) u i (, θ i, θ i ). θ i Θ i A j N i must onsider every θ i nd every in order to evlute u i (, θ i, θ i ). i must weight this utility vlue y: the proility tht would e relized given ll plyers mixed strtegies nd types; the proility tht the other plyers types would e θ i given tht his own type is θ i. Arrow s Impossiility Theorem Leture 12, Slide 4
5 Rep Fun Gme Properties Arrow s Theorem Ex-nte expeted utility Definition (Ex-nte expeted utility) Agent i s ex-nte expeted utility in Byesin gme (N, A, Θ, p, u), where the gents strtegies re given y the mixed strtegy profile s, is defined s EU i (s) = θ i Θ i p(θ i )EU i (s θ i ) or equivlently s EU i (s) = p(θ) s j ( j θ j ) u i (, θ). θ Θ A j N Arrow s Impossiility Theorem Leture 12, Slide 5
6 Rep Fun Gme Properties Arrow s Theorem Nsh equilirium Definition (Byes-Nsh equilirium) A Byes-Nsh equilirium is mixed strtegy profile s tht stisfies i s i BR i (s i ). Definition (ex-post equilirium) A ex-post equilirium is mixed strtegy profile s tht stisfies θ, i, s i rg mx s i S i EU i (s i, s i, θ). Arrow s Impossiility Theorem Leture 12, Slide 6
7 Rep Fun Gme Properties Arrow s Theorem Soil Choie Definition (Soil hoie funtion) Assume set of gents N = {1, 2,..., n}, nd set of outomes (or lterntives, or ndidtes) O. Let L - e the set of non-strit totl orders on O. A soil hoie funtion (over N nd O) is funtion C : L - n O. Definition (Soil welfre funtion) Let N, O, L - e s ove. A soil welfre funtion (over N nd O) is funtion W : L - n L -. Arrow s Impossiility Theorem Leture 12, Slide 7
8 Rep Fun Gme Properties Arrow s Theorem Plurlity pik the outome whih is preferred y the most people Plurlity with elimintion ( instnt runoff ) everyone selets their fvorite outome the outome with the fewest votes is eliminted repet until one outome remins Bord ssign eh outome numer. The most preferred outome gets sore of n 1, the next most preferred gets n 2, down to the n th outome whih gets 0. Then sum the numers for eh outome, nd hoose the one tht hs the highest sore Pirwise elimintion in dvne, deide shedule for the order in whih pirs will e ompred. given two outomes, hve everyone determine the one tht they prefer Arrow s Impossiility Theorem eliminte the outome tht ws not preferred, nd ontinue Leture 12, Slide 8 Some Voting Shemes
9 Rep Fun Gme Properties Arrow s Theorem Condoret Condition If there is ndidte who is preferred to every other ndidte in pirwise runoffs, tht ndidte should e the winner While the Condoret ondition is onsidered n importnt property for voting system to stisfy, there is not lwys Condoret winner sometimes, there s yle where A defets B, B defets C, nd C defets A in their pirwise runoffs Arrow s Impossiility Theorem Leture 12, Slide 9
10 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties 4 Arrow s Theorem Arrow s Impossiility Theorem Leture 12, Slide 10
11 Rep Fun Gme Properties Arrow s Theorem Fun Gme Imgine tht there ws n opportunity to tke one-week lss trip t the end of term, to one of the following destintions: (O) Orlndo, FL (P) Pris, Frne (T) Tehrn, Irn (B) Beijing, Chin Construt your preferene ordering Arrow s Impossiility Theorem Leture 12, Slide 11
12 Rep Fun Gme Properties Arrow s Theorem Fun Gme Imgine tht there ws n opportunity to tke one-week lss trip t the end of term, to one of the following destintions: (O) Orlndo, FL (P) Pris, Frne (T) Tehrn, Irn (B) Beijing, Chin Construt your preferene ordering Vote (truthfully) using eh of the following shemes: plurlity (rise hnds) Arrow s Impossiility Theorem Leture 12, Slide 11
13 Rep Fun Gme Properties Arrow s Theorem Fun Gme Imgine tht there ws n opportunity to tke one-week lss trip t the end of term, to one of the following destintions: (O) Orlndo, FL (P) Pris, Frne (T) Tehrn, Irn (B) Beijing, Chin Construt your preferene ordering Vote (truthfully) using eh of the following shemes: plurlity (rise hnds) plurlity with elimintion (rise hnds) Arrow s Impossiility Theorem Leture 12, Slide 11
14 Rep Fun Gme Properties Arrow s Theorem Fun Gme Imgine tht there ws n opportunity to tke one-week lss trip t the end of term, to one of the following destintions: (O) Orlndo, FL (P) Pris, Frne (T) Tehrn, Irn (B) Beijing, Chin Construt your preferene ordering Vote (truthfully) using eh of the following shemes: plurlity (rise hnds) plurlity with elimintion (rise hnds) Bord (volunteer to tulte) Arrow s Impossiility Theorem Leture 12, Slide 11
15 Rep Fun Gme Properties Arrow s Theorem Fun Gme Imgine tht there ws n opportunity to tke one-week lss trip t the end of term, to one of the following destintions: (O) Orlndo, FL (P) Pris, Frne (T) Tehrn, Irn (B) Beijing, Chin Construt your preferene ordering Vote (truthfully) using eh of the following shemes: plurlity (rise hnds) plurlity with elimintion (rise hnds) Bord (volunteer to tulte) pirwise elimintion (rise hnds, I ll pik shedule) Arrow s Impossiility Theorem Leture 12, Slide 11
16 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties 4 Arrow s Theorem Arrow s Impossiility Theorem Leture 12, Slide 12
17 Rep Fun Gme Properties Arrow s Theorem Nottion N is the set of gents O is finite set of outomes with O 3 L is the set of ll possile strit preferene orderings over O. for ese of exposition we swith to strit orderings we will end up showing tht desirle SWFs nnot e found even if preferenes re restrited to strit orderings [ ] is n element of the set L n ( preferene ordering for every gent; the input to our soil welfre funtion) W is the preferene ordering seleted y the soil welfre funtion W. When the input to W is miguous we write it in the susript; thus, the soil order seleted y W given the input [ ] is denoted s W ([ ]). Arrow s Impossiility Theorem Leture 12, Slide 13
18 Rep Fun Gme Properties Arrow s Theorem Preto Effiieny Definition (Preto Effiieny (PE)) W is Preto effiient if for ny o 1, o 2 O, i o 1 i o 2 implies tht o 1 W o 2. when ll gents gree on the ordering of two outomes, the soil welfre funtion must selet tht ordering. Arrow s Impossiility Theorem Leture 12, Slide 14
19 Rep Fun Gme Properties Arrow s Theorem Independene of Irrelevnt Alterntives Definition (Independene of Irrelevnt Alterntives (IIA)) W is independent of irrelevnt lterntives if, for ny o 1, o 2 O nd ny two preferene profiles [ ], [ ] L n, i (o 1 i o 2 if nd only if o 1 i o 2) implies tht (o 1 W ([ ]) o 2 if nd only if o 1 W ([ ]) o 2 ). the seleted ordering etween two outomes should depend only on the reltive orderings they re given y the gents. Arrow s Impossiility Theorem Leture 12, Slide 15
20 Rep Fun Gme Properties Arrow s Theorem Nondittorship Definition (Non-dittorship) W does not hve dittor if i o 1, o 2 (o 1 i o 2 o 1 W o 2 ). there does not exist single gent whose preferenes lwys determine the soil ordering. We sy tht W is dittoril if it fils to stisfy this property. Arrow s Impossiility Theorem Leture 12, Slide 16
21 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties 4 Arrow s Theorem Arrow s Impossiility Theorem Leture 12, Slide 17
22 Rep Fun Gme Properties Arrow s Theorem Arrow s Theorem Theorem (Arrow, 1951) Any soil welfre funtion W tht is Preto effiient nd independent of irrelevnt lterntives is dittoril. We will ssume tht W is oth PE nd IIA, nd show tht W must e dittoril. Our ssumption tht O 3 is neessry for this proof. The rgument proeeds in four steps. Arrow s Impossiility Theorem Leture 12, Slide 18
23 Rep Fun Gme Properties Arrow s Theorem Arrow s Theorem, Step 1 Step 1: If every voter puts n outome t either the very top or the very ottom of his preferene list, must e t either the very top or very ottom of W s well. Consider n ritrry preferene profile [ ] in whih every voter rnks some O t either the very ottom or very top, nd ssume for ontrdition tht the ove lim is not true. Then, there must exist some pir of distint outomes, O for whih W nd W. Arrow s Impossiility Theorem Leture 12, Slide 19
24 Rep Fun Gme Properties Arrow s Theorem Arrow s Theorem, Step 1 Step 1: If every voter puts n outome t either the very top or the very ottom of his preferene list, must e t either the very top or very ottom of W s well. Now let s modify [ ] so tht every voter moves just ove in his preferene rnking, nd otherwise leves the rnking unhnged; let s ll this new preferene profile [ ]. We know from IIA tht for W or W to hnge, the pirwise reltionship etween nd nd/or the pirwise reltionship etween nd would hve to hnge. However, sine oupies n extreml position for ll voters, n e moved ove without hnging either of these pirwise reltionships. Thus in profile [ ] it is lso the se tht W nd W. From this ft nd from trnsitivity, we hve tht W. However, in [ ] every voter rnks ove nd so PE requires tht W. We hve ontrdition. Arrow s Impossiility Theorem Leture 12, Slide 19
25 Rep Fun Gme Properties Arrow s Theorem Arrow s Theorem, Step 2 Step 2: There is some voter n who is extremely pivotl in the sense tht y hnging his vote t some profile, he n move given outome from the ottom of the soil rnking to the top. Consider preferene profile [ ] in whih every voter rnks lst, nd in whih preferenes re otherwise ritrry. By PE, W must lso rnk lst. Now let voters from 1 to n suessively modify [ ] y moving from the ottom of their rnkings to the top, preserving ll other reltive rnkings. Denote s n the first voter whose hnge uses the soil rnking of to hnge. There lerly must e some suh voter: when the voter n moves to the top of his rnking, PE will require tht e rnked t the top of the soil rnking. Arrow s Impossiility Theorem Leture 12, Slide 20
26 Rep Fun Gme Properties Arrow s Theorem Arrow s Theorem, Step 2 Step 2: There is some voter n who is extremely pivotl in the sense tht y hnging his vote t some profile, he n move given outome from the ottom of the soil rnking to the top. Denote y [ 1 ] the preferene profile just efore n moves, nd denote y [ 2 ] the preferene profile just fter n hs moved to the top of his rnking. In [ 1 ], is t the ottom in W. In [ 2 ], hs hnged its position in W, nd every voter rnks t either the top or the ottom. By the rgument from Step 1, in [ 2 ] must e rnked t the top of W. Profile [ 1 ] : Profile [ 2 ] : Arrow s Impossiility Theorem Leture 12, Slide 20
27 Rep Fun Gme Properties Arrow s Theorem Arrow s Theorem, Step 3 Step 3: n (the gent who is extremely pivotl on outome ) is dittor over ny pir not involving. We egin y hoosing one element from the pir ; without loss of generlity, let s hoose. We ll onstrut new preferene profile [ 3 ] from [ 2 ] y mking two hnges. First, we move to the top of n s preferene ordering, leving it otherwise unhnged; thus n n. Seond, we ritrrily rerrnge the reltive rnkings of nd for ll voters other thn n, while leving in its extreml position. Profile [ 1 ] : Profile [ 2 ] : Profile [ 3 ] : Arrow s Impossiility Theorem Leture 12, Slide 21
28 Rep Fun Gme Properties Arrow s Theorem Arrow s Theorem, Step 3 Step 3: n (the gent who is extremely pivotl on outome ) is dittor over ny pir not involving. In [ 1 ] we hd W, s ws t the very ottom of W. When we ompre [ 1 ] to [ 3 ], reltive rnkings etween nd re the sme for ll voters. Thus, y IIA, we must hve W in [ 3 ] s well. In [ 2 ] we hd W, s ws t the very top of W. Reltive rnkings etween nd re the sme in [ 2 ] nd [ 3 ]. Thus in [ 3 ], W. Using the two ove fts out [ 3 ] nd trnsitivity, we n onlude tht W in [ 3 ]. Profile [ 1 ] : Profile [ 2 ] : Profile [ 3 ] : Arrow s Impossiility Theorem Leture 12, Slide 21
29 Rep Fun Gme Properties Arrow s Theorem Arrow s Theorem, Step 3 Step 3: n (the gent who is extremely pivotl on outome ) is dittor over ny pir not involving. Now onstrut one more preferene profile, [ 4 ], y hnging [ 3 ] in two wys. First, ritrrily hnge the position of in eh voter s ordering while keeping ll other reltive preferenes the sme. Seond, move to n ritrry position in n s preferene ordering, with the onstrint tht remins rnked higher thn. Oserve tht ll voters other thn n hve entirely ritrry preferenes in [ 4 ], while n s preferenes re ritrry exept tht n. Profile [ 1 ] : Profile [ 2 ] : Profile [ 3 ] : Profile [ 4 ] : Arrow s Impossiility Theorem Leture 12, Slide 21
30 Rep Fun Gme Properties Arrow s Theorem Arrow s Theorem, Step 3 Step 3: n (the gent who is extremely pivotl on outome ) is dittor over ny pir not involving. In [ 3 ] nd [ 4 ] ll gents hve the sme reltive preferenes etween nd ; thus, sine W in [ 3 ] nd y IIA, W in [ 4 ]. Thus we hve determined the soil preferene etween nd without ssuming nything exept tht n. Profile [ 1 ] : Profile [ 2 ] : Profile [ 3 ] : Profile [ 4 ] : Arrow s Impossiility Theorem Leture 12, Slide 21
31 Rep Fun Gme Properties Arrow s Theorem Arrow s Theorem, Step 4 Step 4: n is dittor over ll pirs. Consider some third outome. By the rgument in Step 2, there is voter n who is extremely pivotl for. By the rgument in Step 3, n is dittor over ny pir αβ not involving. Of ourse, is suh pir αβ. We hve lredy oserved tht n is le to ffet W s rnking for exmple, when n ws le to hnge W in profile [ 1 ] into W in profile [ 2 ]. Hene, n nd n must e the sme gent. Arrow s Impossiility Theorem Leture 12, Slide 22
Arrow s Impossibility Theorem
Rep Voting Prdoxes Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Voting Prdoxes Properties Arrow s Theorem Leture Overview 1 Rep
More informationConsistent Probabilistic Social Choice
Consistent Proilisti Soil Choie Felix Brndt (with F. Brndl nd H. G. Seedig) University of Oxford, Novemer 2015 Preliminries Finite set of lterntives A A is not fixed Liner preferene reltions L (A) Frtionl
More information1 PYTHAGORAS THEOREM 1. Given a right angled triangle, the square of the hypotenuse is equal to the sum of the squares of the other two sides.
1 PYTHAGORAS THEOREM 1 1 Pythgors Theorem In this setion we will present geometri proof of the fmous theorem of Pythgors. Given right ngled tringle, the squre of the hypotenuse is equl to the sum of the
More information15-451/651: Design & Analysis of Algorithms December 3, 2013 Lecture #28 last changed: November 28, 2013
15-451/651: Design & nlysis of lgorithms Deemer 3, 2013 Leture #28 lst hnged: Novemer 28, 2013 Lst time we strted tlking out mehnism design: how to llote n item to the person who hs the mximum vlue for
More informationAlgorithm Design and Analysis
Algorithm Design nd Anlysis LECTURE 5 Supplement Greedy Algorithms Cont d Minimizing lteness Ching (NOT overed in leture) Adm Smith 9/8/10 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov,
More informationBisimulation, Games & Hennessy Milner logic
Bisimultion, Gmes & Hennessy Milner logi Leture 1 of Modelli Mtemtii dei Proessi Conorrenti Pweł Soboiński Univeristy of Southmpton, UK Bisimultion, Gmes & Hennessy Milner logi p.1/32 Clssil lnguge theory
More informationAlgorithm Design and Analysis
Algorithm Design nd Anlysis LECTURE 8 Mx. lteness ont d Optiml Ching Adm Smith 9/12/2008 A. Smith; sed on slides y E. Demine, C. Leiserson, S. Rskhodnikov, K. Wyne Sheduling to Minimizing Lteness Minimizing
More informationTutorial Worksheet. 1. Find all solutions to the linear system by following the given steps. x + 2y + 3z = 2 2x + 3y + z = 4.
Mth 5 Tutoril Week 1 - Jnury 1 1 Nme Setion Tutoril Worksheet 1. Find ll solutions to the liner system by following the given steps x + y + z = x + y + z = 4. y + z = Step 1. Write down the rgumented mtrix
More informationLecture 6: Coding theory
Leture 6: Coing theory Biology 429 Crl Bergstrom Ferury 4, 2008 Soures: This leture loosely follows Cover n Thoms Chpter 5 n Yeung Chpter 3. As usul, some of the text n equtions re tken iretly from those
More informationProbability. b a b. a b 32.
Proility If n event n hppen in '' wys nd fil in '' wys, nd eh of these wys is eqully likely, then proility or the hne, or its hppening is, nd tht of its filing is eg, If in lottery there re prizes nd lnks,
More informationMAT 403 NOTES 4. f + f =
MAT 403 NOTES 4 1. Fundmentl Theorem o Clulus We will proo more generl version o the FTC thn the textook. But just like the textook, we strt with the ollowing proposition. Let R[, ] e the set o Riemnn
More informationThe University of Nottingham SCHOOL OF COMPUTER SCIENCE A LEVEL 2 MODULE, SPRING SEMESTER MACHINES AND THEIR LANGUAGES ANSWERS
The University of ottinghm SCHOOL OF COMPUTR SCIC A LVL 2 MODUL, SPRIG SMSTR 2015 2016 MACHIS AD THIR LAGUAGS ASWRS Time llowed TWO hours Cndidtes my omplete the front over of their nswer ook nd sign their
More informationNondeterministic Automata vs Deterministic Automata
Nondeterministi Automt vs Deterministi Automt We lerned tht NFA is onvenient model for showing the reltionships mong regulr grmmrs, FA, nd regulr expressions, nd designing them. However, we know tht n
More informationSpacetime and the Quantum World Questions Fall 2010
Spetime nd the Quntum World Questions Fll 2010 1. Cliker Questions from Clss: (1) In toss of two die, wht is the proility tht the sum of the outomes is 6? () P (x 1 + x 2 = 6) = 1 36 - out 3% () P (x 1
More informationCS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6
CS311 Computtionl Strutures Regulr Lnguges nd Regulr Grmmrs Leture 6 1 Wht we know so fr: RLs re losed under produt, union nd * Every RL n e written s RE, nd every RE represents RL Every RL n e reognized
More information6.5 Improper integrals
Eerpt from "Clulus" 3 AoPS In. www.rtofprolemsolving.om 6.5. IMPROPER INTEGRALS 6.5 Improper integrls As we ve seen, we use the definite integrl R f to ompute the re of the region under the grph of y =
More informationT b a(f) [f ] +. P b a(f) = Conclude that if f is in AC then it is the difference of two monotone absolutely continuous functions.
Rel Vribles, Fll 2014 Problem set 5 Solution suggestions Exerise 1. Let f be bsolutely ontinuous on [, b] Show tht nd T b (f) P b (f) f (x) dx [f ] +. Conlude tht if f is in AC then it is the differene
More informationCS 573 Automata Theory and Formal Languages
Non-determinism Automt Theory nd Forml Lnguges Professor Leslie Lnder Leture # 3 Septemer 6, 2 To hieve our gol, we need the onept of Non-deterministi Finite Automton with -moves (NFA) An NFA is tuple
More informationProject 6: Minigoals Towards Simplifying and Rewriting Expressions
MAT 51 Wldis Projet 6: Minigols Towrds Simplifying nd Rewriting Expressions The distriutive property nd like terms You hve proly lerned in previous lsses out dding like terms ut one prolem with the wy
More informationCounting Paths Between Vertices. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs. Isomorphism of Graphs
Isomorphism of Grphs Definition The simple grphs G 1 = (V 1, E 1 ) n G = (V, E ) re isomorphi if there is ijetion (n oneto-one n onto funtion) f from V 1 to V with the property tht n re jent in G 1 if
More informationTechnische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution
Tehnishe Universität Münhen Winter term 29/ I7 Prof. J. Esprz / J. Křetínský / M. Luttenerger. Ferur 2 Solution Automt nd Forml Lnguges Homework 2 Due 5..29. Exerise 2. Let A e the following finite utomton:
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk out solving systems of liner equtions. These re prolems tht give couple of equtions with couple of unknowns, like: 6= x + x 7=
More informationPart 4. Integration (with Proofs)
Prt 4. Integrtion (with Proofs) 4.1 Definition Definition A prtition P of [, b] is finite set of points {x 0, x 1,..., x n } with = x 0 < x 1
More informationTransition systems (motivation)
Trnsition systems (motivtion) Course Modelling of Conurrent Systems ( Modellierung neenläufiger Systeme ) Winter Semester 2009/0 University of Duisurg-Essen Brr König Tehing ssistnt: Christoph Blume In
More informationExercise sheet 6: Solutions
Eerise sheet 6: Solutions Cvet emptor: These re merel etended hints, rther thn omplete solutions. 1. If grph G hs hromti numer k > 1, prove tht its verte set n e prtitioned into two nonempt sets V 1 nd
More informationCS 2204 DIGITAL LOGIC & STATE MACHINE DESIGN SPRING 2014
S 224 DIGITAL LOGI & STATE MAHINE DESIGN SPRING 214 DUE : Mrh 27, 214 HOMEWORK III READ : Relte portions of hpters VII n VIII ASSIGNMENT : There re three questions. Solve ll homework n exm prolems s shown
More information(a) A partition P of [a, b] is a finite subset of [a, b] containing a and b. If Q is another partition and P Q, then Q is a refinement of P.
Chpter 7: The Riemnn Integrl When the derivtive is introdued, it is not hrd to see tht the it of the differene quotient should be equl to the slope of the tngent line, or when the horizontl xis is time
More informationINTEGRATION. 1 Integrals of Complex Valued functions of a REAL variable
INTEGRATION NOTE: These notes re supposed to supplement Chpter 4 of the online textbook. 1 Integrls of Complex Vlued funtions of REAL vrible If I is n intervl in R (for exmple I = [, b] or I = (, b)) nd
More informationRecap Social Choice Fun Game Voting Paradoxes Properties. Social Choice. Lecture 11. Social Choice Lecture 11, Slide 1
Social Choice Lecture 11 Social Choice Lecture 11, Slide 1 Lecture Overview 1 Recap 2 Social Choice 3 Fun Game 4 Voting Paradoxes 5 Properties Social Choice Lecture 11, Slide 2 Formal Definition Definition
More informationNON-DETERMINISTIC FSA
Tw o types of non-determinism: NON-DETERMINISTIC FS () Multiple strt-sttes; strt-sttes S Q. The lnguge L(M) ={x:x tkes M from some strt-stte to some finl-stte nd ll of x is proessed}. The string x = is
More informationMore Properties of the Riemann Integral
More Properties of the Riemnn Integrl Jmes K. Peterson Deprtment of Biologil Sienes nd Deprtment of Mthemtil Sienes Clemson University Februry 15, 2018 Outline More Riemnn Integrl Properties The Fundmentl
More information22: Union Find. CS 473u - Algorithms - Spring April 14, We want to maintain a collection of sets, under the operations of:
22: Union Fin CS 473u - Algorithms - Spring 2005 April 14, 2005 1 Union-Fin We wnt to mintin olletion of sets, uner the opertions of: 1. MkeSet(x) - rete set tht ontins the single element x. 2. Fin(x)
More informationMA10207B: ANALYSIS SECOND SEMESTER OUTLINE NOTES
MA10207B: ANALYSIS SECOND SEMESTER OUTLINE NOTES CHARLIE COLLIER UNIVERSITY OF BATH These notes hve been typeset by Chrlie Collier nd re bsed on the leture notes by Adrin Hill nd Thoms Cottrell. These
More informationDeriving (9.21) in Walsh (1998)
Deriving (9.21) in Wlsh (1998) Henrik Jensen April8,2003 Abstrt This note shows how to derive the nominl interest rte seuring tht the tul money supply lwys is equl to the vlue seuring the verge infltion
More informationComputational Biology Lecture 18: Genome rearrangements, finding maximal matches Saad Mneimneh
Computtionl Biology Leture 8: Genome rerrngements, finding miml mthes Sd Mneimneh We hve seen how to rerrnge genome to otin nother one sed on reversls nd the knowledge of the preserved loks or genes. Now
More informationMATH 409 Advanced Calculus I Lecture 22: Improper Riemann integrals.
MATH 409 Advned Clulus I Leture 22: Improper Riemnn integrls. Improper Riemnn integrl If funtion f : [,b] R is integrble on [,b], then the funtion F(x) = x f(t)dt is well defined nd ontinuous on [,b].
More informationLecture 2: January 27
CS 684: Algorithmic Gme Theory Spring 217 Lecturer: Év Trdos Lecture 2: Jnury 27 Scrie: Alert Julius Liu 2.1 Logistics Scrie notes must e sumitted within 24 hours of the corresponding lecture for full
More informationAP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals
AP Clulus BC Chpter 8: Integrtion Tehniques, L Hopitl s Rule nd Improper Integrls 8. Bsi Integrtion Rules In this setion we will review vrious integrtion strtegies. Strtegies: I. Seprte the integrnd into
More informationParse trees, ambiguity, and Chomsky normal form
Prse trees, miguity, nd Chomsky norml form In this lecture we will discuss few importnt notions connected with contextfree grmmrs, including prse trees, miguity, nd specil form for context-free grmmrs
More informationCS 491G Combinatorial Optimization Lecture Notes
CS 491G Comintoril Optimiztion Leture Notes Dvi Owen July 30, August 1 1 Mthings Figure 1: two possile mthings in simple grph. Definition 1 Given grph G = V, E, mthing is olletion of eges M suh tht e i,
More information16z z q. q( B) Max{2 z z z z B} r z r z r z r z B. John Riley 19 October Econ 401A: Microeconomic Theory. Homework 2 Answers
John Riley 9 Otober 6 Eon 4A: Miroeonomi Theory Homework Answers Constnt returns to sle prodution funtion () If (,, q) S then 6 q () 4 We need to show tht (,, q) S 6( ) ( ) ( q) q [ q ] 4 4 4 4 4 4 Appeling
More informationSolutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!
Solutions for HW9 Exerise 28. () Drw C 6, W 6 K 6, n K 5,3. C 6 : W 6 : K 6 : K 5,3 : () Whih of the following re iprtite? Justify your nswer. Biprtite: put the re verties in V 1 n the lk in V 2. Biprtite:
More informationDiscrete Structures Lecture 11
Introdution Good morning. In this setion we study funtions. A funtion is mpping from one set to nother set or, perhps, from one set to itself. We study the properties of funtions. A mpping my not e funtion.
More informationMATH34032: Green s Functions, Integral Equations and the Calculus of Variations 1. 1 [(y ) 2 + yy + y 2 ] dx,
MATH3403: Green s Funtions, Integrl Equtions nd the Clulus of Vritions 1 Exmples 5 Qu.1 Show tht the extreml funtion of the funtionl I[y] = 1 0 [(y ) + yy + y ] dx, where y(0) = 0 nd y(1) = 1, is y(x)
More informationSection 1.3 Triangles
Se 1.3 Tringles 21 Setion 1.3 Tringles LELING TRINGLE The line segments tht form tringle re lled the sides of the tringle. Eh pir of sides forms n ngle, lled n interior ngle, nd eh tringle hs three interior
More informationp-adic Egyptian Fractions
p-adic Egyptin Frctions Contents 1 Introduction 1 2 Trditionl Egyptin Frctions nd Greedy Algorithm 2 3 Set-up 3 4 p-greedy Algorithm 5 5 p-egyptin Trditionl 10 6 Conclusion 1 Introduction An Egyptin frction
More informationwhere the box contains a finite number of gates from the given collection. Examples of gates that are commonly used are the following: a b
CS 294-2 9/11/04 Quntum Ciruit Model, Solovy-Kitev Theorem, BQP Fll 2004 Leture 4 1 Quntum Ciruit Model 1.1 Clssil Ciruits - Universl Gte Sets A lssil iruit implements multi-output oolen funtion f : {0,1}
More informationMatrices SCHOOL OF ENGINEERING & BUILT ENVIRONMENT. Mathematics (c) 1. Definition of a Matrix
tries Definition of tri mtri is regulr rry of numers enlosed inside rkets SCHOOL OF ENGINEERING & UIL ENVIRONEN Emple he following re ll mtries: ), ) 9, themtis ), d) tries Definition of tri Size of tri
More informationInequalities of Olympiad Caliber. RSME Olympiad Committee BARCELONA TECH
Ineulities of Olymid Clier José Luis Díz-Brrero RSME Olymid Committee BARCELONA TECH José Luis Díz-Brrero RSME Olymi Committee UPC BARCELONA TECH jose.luis.diz@u.edu Bsi fts to rove ineulities Herefter,
More informationMath 32B Discussion Session Week 8 Notes February 28 and March 2, f(b) f(a) = f (t)dt (1)
Green s Theorem Mth 3B isussion Session Week 8 Notes Februry 8 nd Mrh, 7 Very shortly fter you lerned how to integrte single-vrible funtions, you lerned the Fundmentl Theorem of lulus the wy most integrtion
More information5. Every rational number have either terminating or repeating (recurring) decimal representation.
CHAPTER NUMBER SYSTEMS Points to Rememer :. Numer used for ounting,,,,... re known s Nturl numers.. All nturl numers together with zero i.e. 0,,,,,... re known s whole numers.. All nturl numers, zero nd
More informationMid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours
Mi-Term Exmintion - Spring 0 Mthemtil Progrmming with Applitions to Eonomis Totl Sore: 5; Time: hours. Let G = (N, E) e irete grph. Define the inegree of vertex i N s the numer of eges tht re oming into
More informationGlobal alignment. Genome Rearrangements Finding preserved genes. Lecture 18
Computt onl Biology Leture 18 Genome Rerrngements Finding preserved genes We hve seen before how to rerrnge genome to obtin nother one bsed on: Reversls Knowledge of preserved bloks (or genes) Now we re
More informationQUADRATIC EQUATION. Contents
QUADRATIC EQUATION Contents Topi Pge No. Theory 0-04 Exerise - 05-09 Exerise - 09-3 Exerise - 3 4-5 Exerise - 4 6 Answer Key 7-8 Syllus Qudrti equtions with rel oeffiients, reltions etween roots nd oeffiients,
More informationBases for Vector Spaces
Bses for Vector Spces 2-26-25 A set is independent if, roughly speking, there is no redundncy in the set: You cn t uild ny vector in the set s liner comintion of the others A set spns if you cn uild everything
More informationy z A left-handed system can be rotated to look like the following. z
Chpter 2 Crtesin Coördintes The djetive Crtesin bove refers to René Desrtes (1596 1650), who ws the first to oördintise the plne s ordered pirs of rel numbers, whih provided the first sstemti link between
More informationILLUSTRATING THE EXTENSION OF A SPECIAL PROPERTY OF CUBIC POLYNOMIALS TO NTH DEGREE POLYNOMIALS
ILLUSTRATING THE EXTENSION OF A SPECIAL PROPERTY OF CUBIC POLYNOMIALS TO NTH DEGREE POLYNOMIALS Dvid Miller West Virgini University P.O. BOX 6310 30 Armstrong Hll Morgntown, WV 6506 millerd@mth.wvu.edu
More informationAxiomatic social choice theory
Axiomti soil hoie theory From Arrow's impossiility to Fishurn's mximl lotteries ACM EC 2014 Tutoril Shedule 08.30-10.30: Tutoril prt 1 10.30-11.00: Coffee rek 11.00-12.30: Tutoril prt 2! In the interest
More informationAlgorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:
Eidgenössishe Tehnishe Hohshule Zürih Eole polytehnique fédérle de Zurih Politenio federle di Zurigo Federl Institute of Tehnology t Zurih Deprtement of Computer Siene. Novemer 0 Mrkus Püshel, Dvid Steurer
More informationChoosing Combinatorial Social Choice by Heuristic Search
Choosing Comintoril Soil Choie y Heuristi Serh Minyi Li 1 nd Quo Bo Vo 2 Astrt. This pper studies the prolem of omputing ggregtion rules in omintoril domins, where the set of possile lterntives is Crtesin
More informationBridging the gap: GCSE AS Level
Bridging the gp: GCSE AS Level CONTENTS Chpter Removing rckets pge Chpter Liner equtions Chpter Simultneous equtions 8 Chpter Fctors 0 Chpter Chnge the suject of the formul Chpter 6 Solving qudrtic equtions
More informationLecture 3: Equivalence Relations
Mthcmp Crsh Course Instructor: Pdric Brtlett Lecture 3: Equivlence Reltions Week 1 Mthcmp 2014 In our lst three tlks of this clss, we shift the focus of our tlks from proof techniques to proof concepts
More informationCh. 2.3 Counting Sample Points. Cardinality of a Set
Ch..3 Counting Smple Points CH 8 Crdinlity of Set Let S e set. If there re extly n distint elements in S, where n is nonnegtive integer, we sy S is finite set nd n is the rdinlity of S. The rdinlity of
More informationIntroduction to Olympiad Inequalities
Introdution to Olympid Inequlities Edutionl Studies Progrm HSSP Msshusetts Institute of Tehnology Snj Simonovikj Spring 207 Contents Wrm up nd Am-Gm inequlity 2. Elementry inequlities......................
More informationActivities. 4.1 Pythagoras' Theorem 4.2 Spirals 4.3 Clinometers 4.4 Radar 4.5 Posting Parcels 4.6 Interlocking Pipes 4.7 Sine Rule Notes and Solutions
MEP: Demonstrtion Projet UNIT 4: Trigonometry UNIT 4 Trigonometry tivities tivities 4. Pythgors' Theorem 4.2 Spirls 4.3 linometers 4.4 Rdr 4.5 Posting Prels 4.6 Interloking Pipes 4.7 Sine Rule Notes nd
More informationSeptember 13 Homework Solutions
College of Engineering nd Computer Science Mechnicl Engineering Deprtment Mechnicl Engineering 5A Seminr in Engineering Anlysis Fll Ticket: 5966 Instructor: Lrry Cretto Septemer Homework Solutions. Are
More informationPrerna Tower, Road No 2, Contractors Area, Bistupur, Jamshedpur , Tel (0657) ,
R Pen Towe Rod No Conttos Ae Bistupu Jmshedpu 8 Tel (67)89 www.penlsses.om IIT JEE themtis Ppe II PART III ATHEATICS SECTION I (Totl ks : ) (Single Coet Answe Type) This setion ontins 8 multiple hoie questions.
More informationPAIR OF LINEAR EQUATIONS IN TWO VARIABLES
PAIR OF LINEAR EQUATIONS IN TWO VARIABLES. Two liner equtions in the sme two vriles re lled pir of liner equtions in two vriles. The most generl form of pir of liner equtions is x + y + 0 x + y + 0 where,,,,,,
More informationCSE 332. Sorting. Data Abstractions. CSE 332: Data Abstractions. QuickSort Cutoff 1. Where We Are 2. Bounding The MAXIMUM Problem 4
Am Blnk Leture 13 Winter 2016 CSE 332 CSE 332: Dt Astrtions Sorting Dt Astrtions QuikSort Cutoff 1 Where We Are 2 For smll n, the reursion is wste. The onstnts on quik/merge sort re higher thn the ones
More informationEquivalent fractions have the same value but they have different denominators. This means they have been divided into a different number of parts.
Frtions equivlent frtions Equivlent frtions hve the sme vlue ut they hve ifferent enomintors. This mens they hve een ivie into ifferent numer of prts. Use the wll to fin the equivlent frtions: Wht frtions
More information= state, a = reading and q j
4 Finite Automt CHAPTER 2 Finite Automt (FA) (i) Derterministi Finite Automt (DFA) A DFA, M Q, q,, F, Where, Q = set of sttes (finite) q Q = the strt/initil stte = input lphet (finite) (use only those
More information(e) if x = y + z and a divides any two of the integers x, y, or z, then a divides the remaining integer
Divisibility In this note we introduce the notion of divisibility for two integers nd b then we discuss the division lgorithm. First we give forml definition nd note some properties of the division opertion.
More informationNecessary and sucient conditions for some two. Abstract. Further we show that the necessary conditions for the existence of an OD(44 s 1 s 2 )
Neessry n suient onitions for some two vrile orthogonl esigns in orer 44 C. Koukouvinos, M. Mitrouli y, n Jennifer Seerry z Deite to Professor Anne Penfol Street Astrt We give new lgorithm whih llows us
More informationLesson 2.1 Inductive Reasoning
Lesson 2.1 Inutive Resoning Nme Perio Dte For Eerises 1 7, use inutive resoning to fin the net two terms in eh sequene. 1. 4, 8, 12, 16,, 2. 400, 200, 100, 50, 25,, 3. 1 8, 2 7, 1 2, 4, 5, 4. 5, 3, 2,
More informationA Lower Bound for the Length of a Partial Transversal in a Latin Square, Revised Version
A Lower Bound for the Length of Prtil Trnsversl in Ltin Squre, Revised Version Pooy Htmi nd Peter W. Shor Deprtment of Mthemtil Sienes, Shrif University of Tehnology, P.O.Bo 11365-9415, Tehrn, Irn Deprtment
More informationDeriving (9.21) in Walsh (2003)
Deriving (9.21) in Wlsh (2003) "Monetry Eonomis: Mro Aspets" Institute of Eonomis, University of Copenhgen Henrik Jensen Mrh 24, 2004 Abstrt This note shows how to derive the nominl interest rte seuring
More informationChapter 4 State-Space Planning
Leture slides for Automted Plnning: Theory nd Prtie Chpter 4 Stte-Spe Plnning Dn S. Nu CMSC 722, AI Plnning University of Mrylnd, Spring 2008 1 Motivtion Nerly ll plnning proedures re serh proedures Different
More informationProving the Pythagorean Theorem
Proving the Pythgoren Theorem W. Bline Dowler June 30, 2010 Astrt Most people re fmilir with the formul 2 + 2 = 2. However, in most ses, this ws presented in lssroom s n solute with no ttempt t proof or
More informationSurds and Indices. Surds and Indices. Curriculum Ready ACMNA: 233,
Surs n Inies Surs n Inies Curriulum Rey ACMNA:, 6 www.mthletis.om Surs SURDS & & Inies INDICES Inies n surs re very losely relte. A numer uner (squre root sign) is lle sur if the squre root n t e simplifie.
More informationComplete Shrimp Game Solution
Complete Shrimp Game Solution Florian Ederer Feruary 7, 207 The inverse demand urve is given y P (Q a ; Q ; Q ) = 00 0:5 (Q a + Q + Q ) The pro t funtion for rm i = fa; ; g is i (Q a ; Q ; Q ) = Q i [P
More informationMTH 505: Number Theory Spring 2017
MTH 505: Numer Theory Spring 207 Homework 2 Drew Armstrong The Froenius Coin Prolem. Consider the eqution x ` y c where,, c, x, y re nturl numers. We cn think of $ nd $ s two denomintions of coins nd $c
More information12.4 Similarity in Right Triangles
Nme lss Dte 12.4 Similrit in Right Tringles Essentil Question: How does the ltitude to the hpotenuse of right tringle help ou use similr right tringles to solve prolems? Eplore Identifing Similrit in Right
More informationApril 8, 2017 Math 9. Geometry. Solving vector problems. Problem. Prove that if vectors and satisfy, then.
pril 8, 2017 Mth 9 Geometry Solving vetor prolems Prolem Prove tht if vetors nd stisfy, then Solution 1 onsider the vetor ddition prllelogrm shown in the Figure Sine its digonls hve equl length,, the prllelogrm
More informationBehavior Composition in the Presence of Failure
Behvior Composition in the Presene of Filure Sestin Srdin RMIT University, Melourne, Austrli Fio Ptrizi & Giuseppe De Giomo Spienz Univ. Rom, Itly KR 08, Sept. 2008, Sydney Austrli Introdution There re
More informationCS 330 Formal Methods and Models Dana Richards, George Mason University, Spring 2016 Quiz Solutions
CS 330 Forml Methods nd Models Dn Richrds, George Mson University, Spring 2016 Quiz Solutions Quiz 1, Propositionl Logic Dte: Ferury 9 1. (4pts) ((p q) (q r)) (p r), prove tutology using truth tles. p
More informationFor a, b, c, d positive if a b and. ac bd. Reciprocal relations for a and b positive. If a > b then a ab > b. then
Slrs-7.2-ADV-.7 Improper Definite Integrls 27.. D.dox Pge of Improper Definite Integrls Before we strt the min topi we present relevnt lger nd it review. See Appendix J for more lger review. Inequlities:
More informationExpand the Shares Together: Envy-free Mechanisms with a Small Number of Cuts
Nonme mnusript No. (will e inserted y the editor) Expnd the Shres Together: Envy-free Mehnisms with Smll Numer of uts Msoud Seddighin Mjid Frhdi Mohmmd Ghodsi Rez Alijni Ahmd S. Tjik Reeived: dte / Aepted:
More informationFactorising FACTORISING.
Ftorising FACTORISING www.mthletis.om.u Ftorising FACTORISING Ftorising is the opposite of expning. It is the proess of putting expressions into rkets rther thn expning them out. In this setion you will
More informationCS103 Handout 32 Fall 2016 November 11, 2016 Problem Set 7
CS103 Hndout 32 Fll 2016 Novemer 11, 2016 Prolem Set 7 Wht cn you do with regulr expressions? Wht re the limits of regulr lnguges? On this prolem set, you'll find out! As lwys, plese feel free to drop
More informationCS 188 Introduction to Artificial Intelligence Fall 2018 Note 7
CS 188 Introduction to Artificil Intelligence Fll 2018 Note 7 These lecture notes re hevily bsed on notes originlly written by Nikhil Shrm. Decision Networks In the third note, we lerned bout gme trees
More informationProperties of Integrals, Indefinite Integrals. Goals: Definition of the Definite Integral Integral Calculations using Antiderivatives
Block #6: Properties of Integrls, Indefinite Integrls Gols: Definition of the Definite Integrl Integrl Clcultions using Antiderivtives Properties of Integrls The Indefinite Integrl 1 Riemnn Sums - 1 Riemnn
More informationOptimal Network Design with End-to-End Service Requirements
ONLINE SUPPLEMENT for Optiml Networ Design with End-to-End Service Reuirements Anntrm Blrishnn University of Tes t Austin, Austin, TX Gng Li Bentley University, Wlthm, MA Prsh Mirchndni University of Pittsurgh,
More informationNow we must transform the original model so we can use the new parameters. = S max. Recruits
MODEL FOR VARIABLE RECRUITMENT (ontinue) Alterntive Prmeteriztions of the pwner-reruit Moels We n write ny moel in numerous ifferent ut equivlent forms. Uner ertin irumstnes it is onvenient to work with
More informationHow do we solve these things, especially when they get complicated? How do we know when a system has a solution, and when is it unique?
XII. LINEAR ALGEBRA: SOLVING SYSTEMS OF EQUATIONS Tody we re going to tlk bout solving systems of liner equtions. These re problems tht give couple of equtions with couple of unknowns, like: 6 2 3 7 4
More informationSystem Validation (IN4387) November 2, 2012, 14:00-17:00
System Vlidtion (IN4387) Novemer 2, 2012, 14:00-17:00 Importnt Notes. The exmintion omprises 5 question in 4 pges. Give omplete explntion nd do not onfine yourself to giving the finl nswer. Good luk! Exerise
More informationCS 310 (sec 20) - Winter Final Exam (solutions) SOLUTIONS
CS 310 (sec 20) - Winter 2003 - Finl Exm (solutions) SOLUTIONS 1. (Logic) Use truth tles to prove the following logicl equivlences: () p q (p p) (q q) () p q (p q) (p q) () p q p q p p q q (q q) (p p)
More informationTOPIC: LINEAR ALGEBRA MATRICES
Interntionl Blurete LECTUE NOTES for FUTHE MATHEMATICS Dr TOPIC: LINEA ALGEBA MATICES. DEFINITION OF A MATIX MATIX OPEATIONS.. THE DETEMINANT deta THE INVESE A -... SYSTEMS OF LINEA EQUATIONS. 8. THE AUGMENTED
More informationLecture 3. In this lecture, we will discuss algorithms for solving systems of linear equations.
Lecture 3 3 Solving liner equtions In this lecture we will discuss lgorithms for solving systems of liner equtions Multiplictive identity Let us restrict ourselves to considering squre mtrices since one
More informationDorf, R.C., Wan, Z. T- Equivalent Networks The Electrical Engineering Handbook Ed. Richard C. Dorf Boca Raton: CRC Press LLC, 2000
orf, R.C., Wn,. T- Equivlent Networks The Eletril Engineering Hndook Ed. Rihrd C. orf Bo Rton: CRC Press LLC, 000 9 T P Equivlent Networks hen Wn University of Cliforni, vis Rihrd C. orf University of
More informationFarey Fractions. Rickard Fernström. U.U.D.M. Project Report 2017:24. Department of Mathematics Uppsala University
U.U.D.M. Project Report 07:4 Frey Frctions Rickrd Fernström Exmensrete i mtemtik, 5 hp Hledre: Andres Strömergsson Exmintor: Jörgen Östensson Juni 07 Deprtment of Mthemtics Uppsl University Frey Frctions
More information