Consistent Probabilistic Social Choice

Size: px
Start display at page:

Download "Consistent Probabilistic Social Choice"

Transcription

1 Consistent Proilisti Soil Choie Felix Brndt (with F. Brndl nd H. G. Seedig) University of Oxford, Novemer 2015

2 Preliminries Finite set of lterntives A A is not fixed Liner preferene reltions L (A) Frtionl preferene profiles R Δ(L (A)) = R A Δ(L (A)) denotes the ( A!-1)-dimensionl unit simplex impliitly ssumes nonymity nd homogeneity will only onsider rtionl frtions Frtionl olletive preferene R(x,y) = R( ) L (A): x y Mjority mrgin gr(x,y) = R(x,y) - R(y,x) (Wek) Condoret winner x with gr(x,y) 0 for ll y ½ ⅓ ⅙ {,,} R(,)=⅚ gr(,)=⅔ Consistent Proilisti Soil Choie 2 Felix Brndt

3 Proilisti Soil Choie Funtions A proilisti soil hoie funtion (PSCF) f mps preferene profile R R A to non-empty suset of Δ(A). f is (upper hemi-)ontinuous (ontinuity) f(r) is onvex set (onvexity) R R {x,y} nd R(x,y)=1 imply f(r) = {x} (unnimity) {R R A : f(r) =1} is dense in R A (deisiveness) Non-proilisti SCFs re PSCFs where, for ll R R A, f(r)=δ(x) for some X A. The xioms we propose for PSCFs oinide with lssi xioms for the speil se of non-proilisti SCFs. Consistent Proilisti Soil Choie 3 Felix Brndt

4 Rndom Dittorship One gent is piked uniformly t rndom nd his most preferred lterntive is implemented s the soil hoie. RD(R) = { R( ) mx(a) } L (A) RD is (single-vlued) PSCF. It stisfies ontinuity, onvexity, unnimity, nd deisiveness. ½ ⅓ ⅙ RD(R) = {⅚ + ⅙ } Consistent Proilisti Soil Choie 4 Felix Brndt

5 Popultion-Consisteny... p p... Whenever two disjoint eletortes gree on lottery, this lottery should lso e hosen y the union of oth eletortes. Consistent Proilisti Soil Choie 5 Felix Brndt

6 Popultion-Consisteny ½ ½ ½ ½ ¼ ¼ ½ R R ½ R + ½ R ½ + ½ ½ + ½ ½ + ½ f(r) f(r ) f(λr + (1-λ)R ) strong popultion-onsisteny requires equlity (not only inlusion) whenever left-hnd-side is non-empty first proposed y Smith (1973), Young (1974), Fine & Fine (1974) lso known s reinforement (Moulin, 1988) vrints used y Fishurn, Merlin, Myerson, Sri, et. Consistent Proilisti Soil Choie 6 Felix Brndt

7 Composition-Consisteny Deomposle preferene profiles re treted omponent-wise. Consistent Proilisti Soil Choie 7 Felix Brndt

8 Composition-Consisteny ⅓ ⅙ ½ ½ ½ ⅓ ⅔ R R A R B ½ + ⅓ + ⅙ ½ + ½ ⅔ + ⅓ f(r A ) f(r B) = f(r) Lffond, Lslier, nd Le Breton (1996) Cloning-onsisteny preursors: Arrow nd Hurwiz (1972), Mskin (1979), Moulin (1986), Tidemn (1987) Consistent Proilisti Soil Choie 8 Felix Brndt

9 Non-Proilisti Soil Choie Chevlier de Bord Mrquis de Condoret All soring rules stisfy popultion-onsisteny. (Smith 1973; Young, 1974) No Condoret extension stisfies popultion-onsisteny. (Young nd Levenglik, 1978) Mny Condoret extensions stisfy ompositiononsisteny. (Lffond et l., 1996) No Preto-optiml soring rule stisfies ompositiononsisteny. (Lslier, 1996) Theorem: There is no SCF tht stisfies popultiononsisteny nd omposition-onsisteny. But: These two xioms uniquely hrterize PSCF. Consistent Proilisti Soil Choie 9 Felix Brndt

10 Mximl Lotteries Germin Krewers Krewers (1965) nd Fishurn (1984) Peter C. Fishurn redisovered y Lffond et l. (1993), Felsenthl nd Mhover (1992), Fisher nd Ryn (1995), Rivest nd Shen (2010) Extend gr to lotteries: gr(p,q) = x,y p(x) q(y) gr(x,y) frtionl olletive preferenes over lotteries p is mximl lottery, p ML(R), if gr(p,q) 0 for ll q Δ(A). proilisti Condoret winner lwys exists due to Minimx Theorem (v. Neumnn, 1928) Set of profiles with unique mximl lotteries is open nd dense. set of profiles with multiple mximl lotteries is negligile lwys unique for odd numer of voters (Lffond et l., 1997) generlized uniqueness onditions y Le Breton (2005) Consistent Proilisti Soil Choie 10 Felix Brndt

11 Exmples Two lterntives p(x) 1 0 Mximl lotteries 0 ½ 1 gr n e interpreted s symmetri zero-sum gme. Mximl lotteries re mixed minimx strtegies The unique mximl lottery is 3/5 + 1/5 + 1/5. R(x,y) p(x) 1 0 Rndom dittorship 0 ½ 1 R(x,y) Consistent Proilisti Soil Choie 11 Felix Brndt

12 Min Result Theorem: A PSCF f stisfies popultion-onsisteny nd omposition-onsisteny iff f=ml. Proof struture: Composition-onsisteny implies neutrlity. Two-lterntive hrteriztion (vi three-lterntive profiles) Condoret-onsisteny round uniform profile f ML. - Assume for ontrdition tht f yields lottery tht is not mximl. - Construt Condoret profile in whih uniform lottery is returned. - Derive density violtion. ML f. - For ny vertex of the set of mximl lotteries in profile, onstrut sequene of profiles tht onverges to the originl profile nd whose unique mximl lotteries onverge to the originl mximl lottery. - Apply ontinuity nd onvexity. Consistent Proilisti Soil Choie 12 Felix Brndt

13 Two-Alterntive Proof Lemm: Let f e omposition-onsistent PSCF nd A={x,y}. p f(r) with p x,y implies f(r)= Δ(A). Proof: Let r=r(x,y). r 1-r x y y x Hene, λ 2 x + (1-λ 2 )y f(r). r 1-r x x y Repeted pplition, ontinuity, nd onvexity imply the sttement. As onsequene, RD violtes omposition-onsisteny. y x x 1 1-r λx + (1-λ)y λ 2 x + λ(1-λ)x + (1-λ)y λ 2 x + (1-λ 2 )y x y y x Consistent Proilisti Soil Choie 13 Felix Brndt

14 Two-Alterntive Proof (td.) p(x) 1 Simple mjority rule Rndom dittorship 0 0 r ½ 1 R(x,y) Consistent Proilisti Soil Choie 14 Felix Brndt

15 Remrks Independene of xioms popultion, not omposition: rndom dittorship RD omposition, not popultion: mximl lotteries vrint ML 3 ML lmost lwys stisfy strong popultion-onsisteny Composition-onsisteny n e wekened to loningonsisteny when lso requiring Condoret-onsisteny RD stisfies loning-onsisteny ML lso stisfy gend-onsisteny (Sen s α nd γ) Axioms imply Fishurn s C2 (pirwiseness) s well s Condoret-onsisteny. Consistent Proilisti Soil Choie 15 Felix Brndt

16 Remrks (td.) Possile non-proilisti interprettion of outomes s frtionl division (e.g., udget division, time shres) Axioms re eqully nturl. Preto-dominted lterntives lwys get zero proility in every mximl lottery. In ft, ML is even SD-effiient (Aziz et l., 2012). ML does not require symmetry, ompleteness, or even trnsitivity of preferenes. Rndom dittorship requires unique mximum. In ssignment domin, ML re known s populr mixed mthings (Kvith et l., 2011). ML n e effiiently omputed vi liner progrmming. Consistent Proilisti Soil Choie 16 Felix Brndt

17 Mximl Lotteries Rndom Seril Dittorship Bord s Rule popultion-onsisteny only for strit prefs gend-onsisteny loning-onsisteny even omposition-onsisteny Condoret-onsisteny (wek SD-) strtegyproofness wek group-strtegyproofness (wek SD-) prtiiption even for groups even very strongly (SD-) effiieny only for strit prefs otherwise only ex post effiient omputility #P-omplete in P for strit prefs Consistent Proilisti Soil Choie 17 Felix Brndt

18 Advertisement pnyx.dss.in.tum.de oming soon Consistent Proilisti Soil Choie 18 Felix Brndt

Axiomatic social choice theory

Axiomatic 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 information

Arrow s Impossibility Theorem

Arrow s Impossibility Theorem Rep Fun Gme Properties Arrow s Theorem Arrow s Impossiility Theorem Leture 12 Arrow s Impossiility Theorem Leture 12, Slide 1 Rep Fun Gme Properties Arrow s Theorem Leture Overview 1 Rep 2 Fun Gme 3 Properties

More information

Arrow s Impossibility Theorem

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 information

Computational Social Choice

Computational Social Choice Computtionl Soil Choie From Arrow's impossiility to Fishurn's mximl lotteries STACS 2015 Tutoril Motivtion Wht is soil hoie theory? How to ggregte possily onfliting preferenes into olletive hoies in fir

More information

T 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.

T 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 information

Incentives for Participation and Abstention in Probabilistic Social Choice

Incentives for Participation and Abstention in Probabilistic Social Choice Inentives for Prtiiption n Astention in Proilisti Soil Choie Florin Brnl Institut für Informtik TU Münhen, Germny rnlfl@in.tum.e Felix Brnt Institut für Informtik TU Münhen, Germny rntf@in.tum.e Johnnes

More information

Bisimulation, Games & Hennessy Milner logic

Bisimulation, 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 information

Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α

Discrete Structures, Test 2 Monday, March 28, 2016 SOLUTIONS, VERSION α Disrete Strutures, Test 2 Mondy, Mrh 28, 2016 SOLUTIONS, VERSION α α 1. (18 pts) Short nswer. Put your nswer in the ox. No prtil redit. () Consider the reltion R on {,,, d with mtrix digrph of R.. Drw

More information

Logic, Set Theory and Computability [M. Coppenbarger]

Logic, Set Theory and Computability [M. Coppenbarger] 14 Orer (Hnout) Definition 7-11: A reltion is qusi-orering (or preorer) if it is reflexive n trnsitive. A quisi-orering tht is symmetri is n equivlene reltion. A qusi-orering tht is nti-symmetri is n orer

More information

Choosing Combinatorial Social Choice by Heuristic Search

Choosing 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 information

Hyers-Ulam stability of Pielou logistic difference equation

Hyers-Ulam stability of Pielou logistic difference equation vilble online t wwwisr-publitionsom/jns J Nonliner Si ppl, 0 (207, 35 322 Reserh rtile Journl Homepge: wwwtjnsom - wwwisr-publitionsom/jns Hyers-Ulm stbility of Pielou logisti differene eqution Soon-Mo

More information

Technische Universität München Winter term 2009/10 I7 Prof. J. Esparza / J. Křetínský / M. Luttenberger 11. Februar Solution

Technische 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 information

1 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. 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 information

Probability. b a b. a b 32.

Probability. 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 information

#A42 INTEGERS 11 (2011) ON THE CONDITIONED BINOMIAL COEFFICIENTS

#A42 INTEGERS 11 (2011) ON THE CONDITIONED BINOMIAL COEFFICIENTS #A42 INTEGERS 11 (2011 ON THE CONDITIONED BINOMIAL COEFFICIENTS Liqun To Shool of Mthemtil Sienes, Luoyng Norml University, Luoyng, Chin lqto@lynuedun Reeived: 12/24/10, Revised: 5/11/11, Aepted: 5/16/11,

More information

A CLASS OF GENERAL SUPERTREE METHODS FOR NESTED TAXA

A CLASS OF GENERAL SUPERTREE METHODS FOR NESTED TAXA A CLASS OF GENERAL SUPERTREE METHODS FOR NESTED TAXA PHILIP DANIEL AND CHARLES SEMPLE Astrt. Amlgmting smller evolutionry trees into single prent tree is n importnt tsk in evolutionry iology. Trditionlly,

More information

CS 573 Automata Theory and Formal Languages

CS 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 information

Global Preferential Consistency for the Topological Sorting-Based Maximal Spanning Tree Problem a

Global Preferential Consistency for the Topological Sorting-Based Maximal Spanning Tree Problem a Glol Preferentil Consisteny for the Topologil Sorting-Bsed Mximl Spnning Tree Prolem Rémy-Roert Joseph * Astrt. We introdue new type of fully omputle prolems, for DSS dedited to mximl spnning tree prolems,

More information

Pre-Lie algebras, rooted trees and related algebraic structures

Pre-Lie algebras, rooted trees and related algebraic structures Pre-Lie lgers, rooted trees nd relted lgeri strutures Mrh 23, 2004 Definition 1 A pre-lie lger is vetor spe W with mp : W W W suh tht (x y) z x (y z) = (x z) y x (z y). (1) Exmple 2 All ssoitive lgers

More information

Part 4. Integration (with Proofs)

Part 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 information

QUADRATIC EQUATION. Contents

QUADRATIC 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 information

Lecture Notes No. 10

Lecture Notes No. 10 2.6 System Identifition, Estimtion, nd Lerning Leture otes o. Mrh 3, 26 6 Model Struture of Liner ime Invrint Systems 6. Model Struture In representing dynmil system, the first step is to find n pproprite

More information

Lecture 6: Coding theory

Lecture 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 information

Section 3.6. Definite Integrals

Section 3.6. Definite Integrals The Clulus of Funtions of Severl Vribles Setion.6 efinite Integrls We will first define the definite integrl for funtion f : R R nd lter indite how the definition my be extended to funtions of three or

More information

CS 491G Combinatorial Optimization Lecture Notes

CS 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 information

Discrete Structures Lecture 11

Discrete 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 information

CS311 Computational Structures Regular Languages and Regular Grammars. Lecture 6

CS311 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 information

arxiv: v2 [cs.ai] 19 Jun 2014

arxiv: v2 [cs.ai] 19 Jun 2014 Nonme mnusript No. (will be inserted by the editor) Judgment Aggregtion in Multi-Agent Argumenttion Edmond Awd Rihrd Booth Fernndo Tohmé Iyd Rhwn Reeived: dte / Aepted: dte rxiv:1405.6509v2 [s.ai] 19 Jun

More information

s the set of onsequenes. Skeptil onsequenes re more roust in the sense tht they hold in ll possile relities desried y defult theory. All its desirle p

s the set of onsequenes. Skeptil onsequenes re more roust in the sense tht they hold in ll possile relities desried y defult theory. All its desirle p Skeptil Rtionl Extensions Artur Mikitiuk nd Miros lw Truszzynski University of Kentuky, Deprtment of Computer Siene, Lexington, KY 40506{0046, frtur mirekg@s.engr.uky.edu Astrt. In this pper we propose

More information

Solutions for HW9. Bipartite: put the red vertices in V 1 and the black in V 2. Not bipartite!

Solutions 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 information

STRUCTURE OF CONCURRENCY Ryszard Janicki. Department of Computing and Software McMaster University Hamilton, ON, L8S 4K1 Canada

STRUCTURE OF CONCURRENCY Ryszard Janicki. Department of Computing and Software McMaster University Hamilton, ON, L8S 4K1 Canada STRUCTURE OF CONCURRENCY Ryszrd Jnicki Deprtment of Computing nd Softwre McMster University Hmilton, ON, L8S 4K1 Cnd jnicki@mcmster.c 1 Introduction Wht is concurrency? How it cn e modelled? Wht re the

More information

Choix Social Computationnel

Choix Social Computationnel Choix Soil Computtionnel Niols Muet niols.muet@lip6.fr Université Pierre et Mrie Curie 05 Septemre 2011 Motivtion Quest for the est voting system Niols Muet 05 Septemre 2011 Bsis of Soil Choie Mnipultion

More information

Exercise sheet 6: Solutions

Exercise 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 information

Line Integrals and Entire Functions

Line Integrals and Entire Functions Line Integrls nd Entire Funtions Defining n Integrl for omplex Vlued Funtions In the following setions, our min gol is to show tht every entire funtion n be represented s n everywhere onvergent power series

More information

Calculus Cheat Sheet. Integrals Definitions. where F( x ) is an anti-derivative of f ( x ). Fundamental Theorem of Calculus. dx = f x dx g x dx

Calculus Cheat Sheet. Integrals Definitions. where F( x ) is an anti-derivative of f ( x ). Fundamental Theorem of Calculus. dx = f x dx g x dx Clulus Chet Sheet Integrls Definitions Definite Integrl: Suppose f ( ) is ontinuous Anti-Derivtive : An nti-derivtive of f ( ) on [, ]. Divide [, ] into n suintervls of is funtion, F( ), suh tht F = f.

More information

INTEGRATION. 1 Integrals of Complex Valued functions of a REAL variable

INTEGRATION. 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 information

Analysis of Temporal Interactions with Link Streams and Stream Graphs

Analysis of Temporal Interactions with Link Streams and Stream Graphs Anlysis of Temporl Intertions with n Strem Grphs, Tiphine Vir, Clémene Mgnien http:// ltpy@ LIP6 CNRS n Soronne Université Pris, Frne 1/23 intertions over time 0 2 4 6 8,,, n for 10 time units time 2/23

More information

Algebra 2 Semester 1 Practice Final

Algebra 2 Semester 1 Practice Final Alger 2 Semester Prtie Finl Multiple Choie Ientify the hoie tht est ompletes the sttement or nswers the question. To whih set of numers oes the numer elong?. 2 5 integers rtionl numers irrtionl numers

More information

Introduction to Olympiad Inequalities

Introduction 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 information

6.5 Improper integrals

6.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 information

Review: set theoretic definition of the numbers. Natural numbers:

Review: set theoretic definition of the numbers. Natural numbers: Review: reltions A inry reltion on set A is suset R Ñ A ˆ A, where elements p, q re written s. Exmple: A Z nd R t pmod nqu. A inry reltion on set A is... (R) reflexive if for ll P A; (S) symmetric if implies

More information

ad = cb (1) cf = ed (2) adf = cbf (3) cf b = edb (4)

ad = cb (1) cf = ed (2) adf = cbf (3) cf b = edb (4) 10 Most proofs re left s reding exercises. Definition 10.1. Z = Z {0}. Definition 10.2. Let be the binry reltion defined on Z Z by, b c, d iff d = cb. Theorem 10.3. is n equivlence reltion on Z Z. Proof.

More information

Final Exam Review. [Top Bottom]dx =

Final Exam Review. [Top Bottom]dx = Finl Exm Review Are Between Curves See 7.1 exmples 1, 2, 4, 5 nd exerises 1-33 (odd) The re of the region bounded by the urves y = f(x), y = g(x), nd the lines x = nd x = b, where f nd g re ontinuous nd

More information

Now we must transform the original model so we can use the new parameters. = S max. Recruits

Now 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 information

AP Calculus AB Unit 4 Assessment

AP Calculus AB Unit 4 Assessment Clss: Dte: 0-04 AP Clulus AB Unit 4 Assessment Multiple Choie Identify the hoie tht best ompletes the sttement or nswers the question. A lultor my NOT be used on this prt of the exm. (6 minutes). The slope

More information

Theory of the Integral

Theory of the Integral Spring 2012 Theory of the Integrl Author: Todd Gugler Professor: Dr. Drgomir Sric My 10, 2012 2 Contents 1 Introduction 5 1.0.1 Office Hours nd Contct Informtion..................... 5 1.1 Set Theory:

More information

Chapter 1: Fundamentals

Chapter 1: Fundamentals Chpter 1: Fundmentls 1.1 Rel Numbers Types of Rel Numbers: Nturl Numbers: {1, 2, 3,...}; These re the counting numbers. Integers: {... 3, 2, 1, 0, 1, 2, 3,...}; These re ll the nturl numbers, their negtives,

More information

MATHEMATICS PAPER & SOLUTION

MATHEMATICS PAPER & SOLUTION MATHEMATICS PAPER & SOLUTION Code: SS--Mtemtis Time : Hours M.M. 8 GENERAL INSTRUCTIONS TO THE EXAMINEES:. Cndidte must write first is / er Roll No. on te question pper ompulsorily.. All te questions re

More information

Minimal DFA. minimal DFA for L starting from any other

Minimal DFA. minimal DFA for L starting from any other Miniml DFA Among the mny DFAs ccepting the sme regulr lnguge L, there is exctly one (up to renming of sttes) which hs the smllest possile numer of sttes. Moreover, it is possile to otin tht miniml DFA

More information

A A Geometric Perspective on Minimal Peer Prediction

A A Geometric Perspective on Minimal Peer Prediction A A Geometri Perspetive on Miniml Peer Predition RAFAEL FRONGILLO, CU Boulder JENS WITKOWSKI, ETH Zurih Miniml peer predition mehnisms truthfully eliit privte informtion (e.g., opinions or experienes)

More information

Complexity of intuitionistic logic. Martin Mundhenk

Complexity of intuitionistic logic. Martin Mundhenk Complexity of intuitionistic logic Mrtin Mundhenk 2 The formul evlution problem k the model checking problem Given: formul α for the logic L nd model M ccording to the semntics of L Decide: does M stisfy

More information

Logic Synthesis and Verification

Logic Synthesis and Verification Logi Synthesis nd Verifition SOPs nd Inompletely Speified Funtions Jie-Hong Rolnd Jing 江介宏 Deprtment of Eletril Engineering Ntionl Tiwn University Fll 2010 Reding: Logi Synthesis in Nutshell Setion 2 most

More information

RIEMANN INTEGRATION. Throughout our discussion of Riemann integration. B = B [a; b] = B ([a; b] ; R)

RIEMANN INTEGRATION. Throughout our discussion of Riemann integration. B = B [a; b] = B ([a; b] ; R) RIEMANN INTEGRATION Throughout our disussion of Riemnn integrtion B = B [; b] = B ([; b] ; R) is the set of ll bounded rel-vlued funtons on lose, bounded, nondegenerte intervl [; b] : 1. DEF. A nite set

More information

CHAPTER V INTEGRATION, AVERAGE BEHAVIOR A = πr 2.

CHAPTER V INTEGRATION, AVERAGE BEHAVIOR A = πr 2. CHAPTER V INTEGRATION, AVERAGE BEHAVIOR A πr 2. In this hpter we will derive the formul A πr 2 for the re of irle of rdius r. As mtter of ft, we will first hve to settle on extly wht is the definition

More information

Chapter 4 State-Space Planning

Chapter 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 information

MA10207B: ANALYSIS SECOND SEMESTER OUTLINE NOTES

MA10207B: 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 information

Best Approximation. Chapter The General Case

Best Approximation. Chapter The General Case Chpter 4 Best Approximtion 4.1 The Generl Cse In the previous chpter, we hve seen how n interpolting polynomil cn be used s n pproximtion to given function. We now wnt to find the best pproximtion to given

More information

MAT 403 NOTES 4. f + f =

MAT 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 information

378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A.

378 Relations Solutions for Chapter 16. Section 16.1 Exercises. 3. Let A = {0,1,2,3,4,5}. Write out the relation R that expresses on A. 378 Reltions 16.7 Solutions for Chpter 16 Section 16.1 Exercises 1. Let A = {0,1,2,3,4,5}. Write out the reltion R tht expresses > on A. Then illustrte it with digrm. 2 1 R = { (5,4),(5,3),(5,2),(5,1),(5,0),(4,3),(4,2),(4,1),

More information

Transition systems (motivation)

Transition 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 information

Unique Solutions R. 4. Probability. C h a p t e r. G l a n c e

Unique Solutions R. 4. Probability. C h a p t e r. G l a n c e . Proility C h p t e r t G l n e Rnom Experiment : An t in whih ll possile (outomes) results re known in vne ut none of them n e preite with ertinty is lle rnom experiment. For e.g. When we toss oin, we

More information

KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS CLASS - XII MATHEMATICS (Relations and Functions & Binary Operations)

KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS CLASS - XII MATHEMATICS (Relations and Functions & Binary Operations) KENDRIYA VIDYALAYA IIT KANPUR HOME ASSIGNMENTS FOR SUMMER VACATIONS 6-7 CLASS - XII MATHEMATICS (Reltions nd Funtions & Binry Opertions) For Slow Lerners: - A Reltion is sid to e Reflexive if.. every A

More information

The Riemann and the Generalised Riemann Integral

The Riemann and the Generalised Riemann Integral The Riemnn nd the Generlised Riemnn Integrl Clvin 17 July 14 Contents 1 The Riemnn Integrl 1.1 Riemnn Integrl............................................ 1. Properties o Riemnn Integrble Funtions.............................

More information

4.1. Probability Density Functions

4.1. Probability Density Functions STT 1 4.1-4. 4.1. Proility Density Functions Ojectives. Continuous rndom vrile - vers - discrete rndom vrile. Proility density function. Uniform distriution nd its properties. Expected vlue nd vrince of

More information

E 1 (n) = E 0 (n-1) E 0 (n) = E 0 (n-1)+e 0 (n-2) T(n -1)=2E 0 (n-2) + E 0 (n-3)

E 1 (n) = E 0 (n-1) E 0 (n) = E 0 (n-1)+e 0 (n-2) T(n -1)=2E 0 (n-2) + E 0 (n-3) cs3102: Theory of Computtion Clss 5: Non-Regulr PS1, Prolem 8 Menu Non-regulr lnguges Spring 2010 University of Virgini Dvid Evns PS1 Generl Comments Proofs re for mking convincing rguments, not for ofusction.

More information

Lesson 2.1 Inductive Reasoning

Lesson 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 information

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)}

Graph Theory. Simple Graph G = (V, E). V={a,b,c,d,e,f,g,h,k} E={(a,b),(a,g),( a,h),(a,k),(b,c),(b,k),...,(h,k)} Grph Theory Simple Grph G = (V, E). V ={verties}, E={eges}. h k g f e V={,,,,e,f,g,h,k} E={(,),(,g),(,h),(,k),(,),(,k),...,(h,k)} E =16. 1 Grph or Multi-Grph We llow loops n multiple eges. G = (V, E.ψ)

More information

Joint distribution. Joint distribution. Marginal distributions. Joint distribution

Joint distribution. Joint distribution. Marginal distributions. Joint distribution Joint distribution To specify the joint distribution of n rndom vribles X 1,...,X n tht tke vlues in the smple spces E 1,...,E n we need probbility mesure, P, on E 1... E n = {(x 1,...,x n ) x i E i, i

More information

Unit 4. Combinational Circuits

Unit 4. Combinational Circuits Unit 4. Comintionl Ciruits Digitl Eletroni Ciruits (Ciruitos Eletrónios Digitles) E.T.S.I. Informáti Universidd de Sevill 5/10/2012 Jorge Jun 2010, 2011, 2012 You re free to opy, distriute

More information

Mid-Term Examination - Spring 2014 Mathematical Programming with Applications to Economics Total Score: 45; Time: 3 hours

Mid-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 information

Surface maps into free groups

Surface maps into free groups Surfce mps into free groups lden Wlker Novemer 10, 2014 Free groups wedge X of two circles: Set F = π 1 (X ) =,. We write cpitl letters for inverse, so = 1. e.g. () 1 = Commuttors Let x nd y e loops. The

More information

5. Every rational number have either terminating or repeating (recurring) decimal representation.

5. 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 information

1. Gauss-Jacobi quadrature and Legendre polynomials. p(t)w(t)dt, p {p(x 0 ),...p(x n )} p(t)w(t)dt = w k p(x k ),

1. Gauss-Jacobi quadrature and Legendre polynomials. p(t)w(t)dt, p {p(x 0 ),...p(x n )} p(t)w(t)dt = w k p(x k ), 1. Guss-Jcobi qudrture nd Legendre polynomils Simpson s rule for evluting n integrl f(t)dt gives the correct nswer with error of bout O(n 4 ) (with constnt tht depends on f, in prticulr, it depends on

More information

Bases for Vector Spaces

Bases 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 information

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17

Discrete Mathematics and Probability Theory Spring 2013 Anant Sahai Lecture 17 EECS 70 Discrete Mthemtics nd Proility Theory Spring 2013 Annt Shi Lecture 17 I.I.D. Rndom Vriles Estimting the is of coin Question: We wnt to estimte the proportion p of Democrts in the US popultion,

More information

MATH 409 Advanced Calculus I Lecture 22: Improper Riemann integrals.

MATH 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 information

Can one hear the shape of a drum?

Can one hear the shape of a drum? Cn one her the shpe of drum? After M. K, C. Gordon, D. We, nd S. Wolpert Corentin Lén Università Degli Studi di Torino Diprtimento di Mtemti Giuseppe Peno UNITO Mthemtis Ph.D Seminrs Mondy 23 My 2016 Motivtion:

More information

Compression of Palindromes and Regularity.

Compression of Palindromes and Regularity. Compression of Plinromes n Regulrity. Kyoko Shikishim-Tsuji Center for Lierl Arts Eution n Reserh Tenri University 1 Introution In [1], property of likstrem t t view of tse is isusse n it is shown tht

More information

Computational Biology Lecture 18: Genome rearrangements, finding maximal matches Saad Mneimneh

Computational 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 information

Translation symmetry, Space groups, Bloch functions, Fermi energy

Translation symmetry, Space groups, Bloch functions, Fermi energy 9/7/4 Trnsltion symmetry, Spe groups, Bloh funtions, Fermi energy Roerto Orlndo Diprtimento di Chimi Università di Torino Vi ietro Giuri 5, 6 Torino, Itly roerto.orlndo@unito.it Outline The rystllogrphi

More information

The Inspherical Gergonne Center of a Tetrahedron

The Inspherical Gergonne Center of a Tetrahedron Journl for Geometry nd Grphis Volume 8 (2004), No. 1, 23 32. The Inspheril Gergonne Center of Tetrhedron Mowffq Hjj 1, Peter Wlker 2 1 Deprtment of Mthemtis, Yrmouk University Irbid, Jordn emil: mhjj@yu.edu.jo

More information

On Determinism in Modal Transition Systems

On Determinism in Modal Transition Systems On Determinism in Modl Trnsition Systems N. Beneš,2, J. Křetínský,3, K. G. Lrsen 5, J. Sr,4 Deprtment of Computer Siene, Alorg University, Selm Lgerlöfs Vej 300, 9220 Alorg Øst, Denmrk Astrt Modl trnsition

More information

Linearly Similar Polynomials

Linearly Similar Polynomials Linerly Similr Polynomils rthur Holshouser 3600 Bullrd St. Chrlotte, NC, US Hrold Reiter Deprtment of Mthemticl Sciences University of North Crolin Chrlotte, Chrlotte, NC 28223, US hbreiter@uncc.edu stndrd

More information

Metodologie di progetto HW Technology Mapping. Last update: 19/03/09

Metodologie di progetto HW Technology Mapping. Last update: 19/03/09 Metodologie di progetto HW Tehnology Mpping Lst updte: 19/03/09 Tehnology Mpping 2 Tehnology Mpping Exmple: t 1 = + b; t 2 = d + e; t 3 = b + d; t 4 = t 1 t 2 + fg; t 5 = t 4 h + t 2 t 3 ; F = t 5 ; t

More information

p-adic Egyptian Fractions

p-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 information

arxiv: v1 [math.ca] 21 Aug 2018

arxiv: v1 [math.ca] 21 Aug 2018 rxiv:1808.07159v1 [mth.ca] 1 Aug 018 Clulus on Dul Rel Numbers Keqin Liu Deprtment of Mthemtis The University of British Columbi Vnouver, BC Cnd, V6T 1Z Augest, 018 Abstrt We present the bsi theory of

More information

System Validation (IN4387) November 2, 2012, 14:00-17:00

System 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 information

16z 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

16z 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 information

Algorithms & Data Structures Homework 8 HS 18 Exercise Class (Room & TA): Submitted by: Peer Feedback by: Points:

Algorithms & 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 information

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying

W. We shall do so one by one, starting with I 1, and we shall do it greedily, trying Vitli covers 1 Definition. A Vitli cover of set E R is set V of closed intervls with positive length so tht, for every δ > 0 nd every x E, there is some I V with λ(i ) < δ nd x I. 2 Lemm (Vitli covering)

More information

On the Axiomatic Foundations of Ranking Systems

On the Axiomatic Foundations of Ranking Systems On the Axiomti Fountions of Rnking Systems Alon Altmn n Moshe Tennenholtz Fulty of Inustril Engineering n Mngement Tehnion Isrel Institute of Tehnology Hif 32000 Isrel Astrt Resoning out gent preferenes

More information

Behavior Composition in the Presence of Failure

Behavior 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 information

Separable discrete functions: recognition and sufficient conditions

Separable discrete functions: recognition and sufficient conditions Seprle isrete funtions: reognition n suffiient onitions Enre Boros Onřej Čepek Vlimir Gurvih Novemer 21, 217 rxiv:1711.6772v1 [mth.co] 17 Nov 217 Astrt A isrete funtion of n vriles is mpping g : X 1...

More information

MATH1050 Cauchy-Schwarz Inequality and Triangle Inequality

MATH1050 Cauchy-Schwarz Inequality and Triangle Inequality MATH050 Cuchy-Schwrz Inequlity nd Tringle Inequlity 0 Refer to the Hndout Qudrtic polynomils Definition (Asolute extrem for rel-vlued functions of one rel vrile) Let I e n intervl, nd h : D R e rel-vlued

More information

15-451/651: Design & Analysis of Algorithms December 3, 2013 Lecture #28 last changed: November 28, 2013

15-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 information

Consequently, the temperature must be the same at each point in the cross section at x. Let:

Consequently, the temperature must be the same at each point in the cross section at x. Let: HW 2 Comments: L1-3. Derive the het eqution for n inhomogeneous rod where the therml coefficients used in the derivtion of the het eqution for homogeneous rod now become functions of position x in the

More information

AP Calculus BC Chapter 8: Integration Techniques, L Hopital s Rule and Improper Integrals

AP 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 information

1.1. Linear Constant Coefficient Equations. Remark: A differential equation is an equation

1.1. Linear Constant Coefficient Equations. Remark: A differential equation is an equation 1 1.1. Liner Constnt Coefficient Equtions Section Objective(s): Overview of Differentil Equtions. Liner Differentil Equtions. Solving Liner Differentil Equtions. The Initil Vlue Problem. 1.1.1. Overview

More information

Project 6: Minigoals Towards Simplifying and Rewriting Expressions

Project 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 information

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O

The area under the graph of f and above the x-axis between a and b is denoted by. f(x) dx. π O 1 Section 5. The Definite Integrl Suppose tht function f is continuous nd positive over n intervl [, ]. y = f(x) x The re under the grph of f nd ove the x-xis etween nd is denoted y f(x) dx nd clled the

More information