2 Pages

Lec9

Course: JOUR 201, Spring 2012
School: USC
Rating:
 
 
 
 
 

Word Count: 376

Document Preview

WWI Between and the 1920s Russian oeasents revolted message of socialism was being globally transmitted factions that were very unhappy wiht the gov't and our entry into the war the great influenza epidemic wiped out 12 -20 million people made Americans less instuler part of a global economy and social state Era of prohibition banned the selling of alchohal in the US started an underground market i.e...

Register Now

Unformatted Document Excerpt

Coursehero >> California >> USC >> JOUR 201

Course Hero has millions of student submitted documents similar to the one
below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.

Course Hero has millions of student submitted documents similar to the one below including study guides, practice problems, reference materials, practice exams, textbook help and tutor support.
WWI Between and the 1920s Russian oeasents revolted message of socialism was being globally transmitted factions that were very unhappy wiht the gov't and our entry into the war the great influenza epidemic wiped out 12 -20 million people made Americans less instuler part of a global economy and social state Era of prohibition banned the selling of alchohal in the US started an underground market i.e speakeasys The Roaring 20s Magazine Explosion Americana Post WWI Historians characterize the time full of dance, happy go lucky Women achieved the vote vote influenced by their households 106.4 million in 1920 census Highest literacy rate to date 6% of total population was illiterate 1870, nearly 7 million children were enrolled in lementary schools and 80,00 were enrolled in secondary schools in 1920, nearly 25 mil elementary schools and 400,000 secondary schools Shift from rual to urban 1900: 39% of pop classified as urban dwellers 1920: 51% Today: 78% The Magazine World Explodes Modern Era Saturday Evening Post Founded by Cyrus Curtis in 1897 for $1,000 added color into the magazine population was "clamoring" for more in depth and special interes stories "first magazine of the modern era" Women's ,agazines Flourish paris fashion scene/ liberating styles Household new gadgets Smart publishers like Curtis saw the need for marketing to women start to make magazines only for women the "7 sisters" "light hearted", informative, educational and fun no stories about crime or murder George Horace Lorimer Post editor from 1899-1936 engaged famous and talented writers Fitgerald, Sinclair Lewis, etc. this gave the magazine panache, "standards" Viewed the cover as a unique selling/ comminication opportunity create the idea of having attractive covers covers were all illustrations, no photographs Illustrations comic book style art deco (Vanity Fair) th art was very "targeted" towards the magazine's audience National Geographic had no picture cover at all (until the 1960s) huge range of illustration type Industry publishers began to recognize that people had "special interests" people want to know more about their interests climate where people want to know other perspectives on a specific topic Economics magazines make the most money from single copy sale money from subscriptions advertisements 50% of the magazine in constituded my ads In 2004 subscriptions eclipsed ad revenue people are demanding more content and fewer ads magazine must charge more for an ad i order to have less ads
Find millions of documents on Course Hero - Study Guides, Lecture Notes, Reference Materials, Practice Exams and more. Course Hero has millions of course specific materials providing students with the best way to expand their education.

Below is a small sample set of documents:

USC - BUAD - 304
Functions of CommunicationCommunicationThe transference and understanding of meaningCommunication Functions -Control member behavior-foster motivation for what is to be done-provide a release for emotional expression-provide information needed to ma
USC - WRIT 140 - writ 140
Sean SharkeyWriting 1403/4/12Josh BernsteinThe Need for CoexistenceSpike Lees 1989 film, Do the Right Thing, centers around a community inBedford-Stuyvesant, Brooklyn undergoing gentrification and the racial tensionsthat accompany that process. The
École Normale Supérieure - 412 - 002
41 LqwurgxfwlrqDxfwlrq wkhru| lv lpsruwdqw iru sudfwlfdo/ hpslulfdo/ dqg wkhruhwlfdo uhdvrqv1 Iluvw/ d kxjh yroxph ri hfrqrplf wudqvdfwlrqv lv frqgxfwhg wkurxjk dxfwlrqv1 Jry0 huqphqwv xvh dxfwlrqv wr vhoo wuhdvxu| eloov/ iruhljq hcfw_fkdqjh/ plqhudo ulj
École Normale Supérieure - 412 - 002
Ec1052: Introduction to Game Theory Harvard UniversityHandout 7 19 March 2004Cheat Sheet for MidtermThis handout summarizes what you have to know for the midterm in Econ 1052. Lecture I-II: Decision Theory axioms of decision theory lotteries proof of e
École Normale Supérieure - 412 - 002
Lecture I-II: Motivation and Decision TheoryMarkus M. Mbius o February 4, 20031Motivating Experiment: Guess the averageSetup: Each of you (the students in this course) have to declare an integer between 0 and 100 to guess "2/3 of the average of all th
École Normale Supérieure - 412 - 002
Lecture III: Normal Form Games, Rationality and Iterated Deletion of Dominated StrategiesMarkus M. Mbius o February 19, 2004Readings: Gibbons, sections 1.1.A and 1.1.B Osborne, sections 2.1-2.5 and section 2.91Definition of Normal Form GameGame theor
École Normale Supérieure - 412 - 002
Lecture IV: Nash Equilibrium II - Multiple EquilibriaMarkus M. Mbius o March 3, 2003Readings for this class: Osborne and Rubinstein, Chapter 2.12.31Multiple Equilibria I - CoordinationLots of games have multiple Nash equilibria. In this case the prob
École Normale Supérieure - 412 - 002
Lecture V: Mixed StrategiesMarkus M. Mbius o February 24, 2004 Gibbons, sections 1.3-1.3.A Osborne, chapter 41The Advantage of Mixed StrategiesConsider the following Rock-Paper-Scissors game: Note that RPS is a zerosum game.R P SR0,0-1,11,-1P1
École Normale Supérieure - 412 - 002
Lecture VI: Existence of Nash equilibriumMarkus M. Mbius o February 26, 2004 Gibbons, sections 1.3B Osborne, chapter 41Nash's Existence TheoremWhen we introduced the notion of Nash equilibrium the idea was to come up with a solution concept which is
École Normale Supérieure - 412 - 002
Lecture VII: Common KnowledgeMarkus M. Mbius o March 4, 2004This is the one of the two advanced topics (the other is learning) which is not discussed in the two main texts. I tried to make the lecture notes self-contained. Osborne and Rubinstein, sectio
École Normale Supérieure - 412 - 002
Lecture VIII: LearningMarkus M. Mbius o March 10, 2004Learning and evolution are the second set of topics which are not discussed in the two main texts. I tried to make the lecture notes self-contained. Fudenberg and Levine (1998), The Theory of Learnin
École Normale Supérieure - 412 - 002
Lecture IX: EvolutionMarkus M. Mbius o March 10, 2004Learning and evolution are the second set of topics which are not discussed in the two main texts. I tried to make the lecture notes self-contained. Fudenberg and Levine (1998), The Theory of Learning
École Normale Supérieure - 412 - 002
Lecture X: Extensive Form GamesMarkus M. Mbius o March 17, 2004 Gibbons, chapter 2 Osborne, sections 5.1, 5.2 and chapter 61IntroductionWhile models presented so far are fairly general in some ways it should be noted that they have one main limitatio
École Normale Supérieure - 412 - 002
Lecture XI: Subgame Perfect EquilibriumMarkus M. Mbius o April 3, 2004 Gibbons, chapter 2.1.A,2.1.B,2.2.A Osborne, sections 5.4, 5.51IntroductionLast time we discussed extensive form representation and showed that there are typically lots of Nash equ
Academy of Art University - DFDAS - 220
Lecture I-II: Motivation and Decision TheoryMarkus M. Mbius o February 7, 20041Two Motivating ExperimentsExperiment 1 Each of you (the students in this course) have to declare an integer between 0 and 100 to guess "2/3 of the average of all the respon
Academy of Art University - DFDAS - 220
Lecture IV: Nash EquilibriumMarkus M. Mbius o March 3, 2003Readings for this class: Osborne and Rubinstein, Chapter 2.12.3; FT has a good section on the connection to IDSDS. Iterated dominance is an attractive solution concept because it only assumes th
Academy of Art University - DFDAS - 220
Lecture XII: Analysis of Infinite GamesMarkus M. Mbius o April 7, 2004 Gibbons, chapter 2.1.A,2.1.B,2.2.A Osborne, sections 14.1-14.4, 16 Oxborne and Rubinstein, sections 6.5, 8.1 and 8.21Introduction - Critique of SPEThe SPE concept eliminates non-c
Academy of Art University - DFDAS - 220
Lecture XIII: Repeated GamesMarkus M. Mbius o April 19, 2004 Gibbons, chapter 2.3.B,2.3.C Osborne, chapter 14 Osborne and Rubinstein, sections 8.3-8.51IntroductionSo far one might get a somewhat misleading impression about SPE. When we first introduc
Academy of Art University - DFDAS - 220
Lecture XIV: Applications of Repeated GamesMarkus M. Mbius o April 28, 2004 Gibbons, chapter 2.3.D,2.3.E Osborne, chapter 141IntroductionWe have quite thoroughly discussed the theory of repeated games. In this lecture we discuss applications. The sel
Academy of Art University - DFDAS - 220
Lecture XV: Games with Incomplete InformationMarkus M. Mbius o April 28, 2004 Gibbons, chapter 3 Osborne, chapter 91IntroductionInformally, a game with incomplete information is a game where the game being played is not common knowledge. This idea is
Academy of Art University - DFDAS - 220
Lecture XVI: AuctionsMarkus M. Mbius o May 6, 2004 Gibbons, chapter 3 Osborne, chapter 9 Paul Klemperer's website at http:/www.paulklemperer.org/ has fantastic online material on auctions and related topics.1IntroductionWe already introduced a privat
Academy of Art University - DFDAS - 220
Lecture XVII: Dynamic Games with Incomplete InformationMarkus M. Mbius o May 6, 2004 Gibbons, sections 4.1 and 4.2 Osborne, chapter 101IntroductionIn the last two lectures I introduced the idea of incomplete information. We analyzed some important si
Academy of Art University - DFDAS - 220
Lecture XVIII: Games with Incomplete Information II - More ExamplesMarkus M. Mbius o May 6, 2004 Gibbons, section 4.2 Osborne, chapter 101IntroductionThis lecture gives more examples of games of incomplete information, in particular signalling games.
Academy of Art University - DFDAS - 220
Lecture IV: Nash EquilibriumMarkus M. Mbius o February 19, 2004Readings: Gibbons, sections 1.1.C and 1.2.B Osborne, sections 2.6-2.8 and sections 3.1 and 3.2 Iterated dominance is an attractive solution concept because it only assumes that all players a
Academy of Art University - DFDAS - 220
Lecture IV: Nash Equilibrium II - Multiple EquilibriaMarkus M. Mbius o February 24, 2004 Gibbons, sections 1.1.C and 1.2.B Osborne, sections 2.6-2.8 and sections 3.1 and 3.21Multiple Equilibria I - CoordinationLots of games have multiple Nash equilib
Academy of Art University - DFDAS - 220
Lecture XVI: AuctionsMarkus M. Mbius o April 14, 2002Readings for this class: P. Klemperer - Auction Theory: A Guide to the Literature (especially parts of the appendix - the main text provides an excellent introduction to auction theory but is optional
Academy of Art University - DFDAS - 220
Ec1052: Introduction to Game Theory Harvard UniversityHandout 1 12 February 2004Problem Set 1Due: Thursday, 19 February (in class).This problems set requires knowledge of von-Neumann Morgenstern decision theory. Challenging problems are marked with on
Academy of Art University - DFDAS - 220
Ec1052: Introduction to Game Theory Harvard UniversityHandout 3 21 February 2004Problem Set 2Due: Saturday, 6 March (Irit's mail folder on the second floor of Littauer up the stairs and to your left). Challenging problems are marked with one star. Doub
Academy of Art University - DFDAS - 220
Ec1052: Introduction to Game Theory Harvard UniversityHandout 5 6 March 2004Problem Set 3Due: Friday, 19 March 2004Challenging problems are marked with one star. Double-starred questions do NOT count towards the grade. They are very hard and simply fo
Academy of Art University - DFDAS - 220
Ec1052: Introduction to Game Theory Harvard UniversityHandout 10 23 March 2004Problem Set 4Due: Saturday, 10 April, 5pm sharp (Irit's folder at Littauer)Challenging problems are marked with one star. Double-starred questions do NOT count towards the g
Academy of Art University - DFDAS - 220
Ec1052: Introduction to Game Theory Harvard UniversityHandout 12 18 April 2004Problem Set 5Due: Thursday, 29 April (in class).Challenging problems are marked with one star. Double-starred questions do NOT count towards the grade. They are very hard an
Academy of Art University - DFDAS - 220
Ec1052: Introduction to Game Theory Harvard UniversityHandout 14 18 April 2004Problem Set 6Due: Saturday, May 8 (Irit's folder)Challenging problems are marked with one star. Double-starred questions do NOT count towards the grade. They are very hard a
Academy of Art University - DFDAS - 220
Ec1052: Introduction to Game Theory Harvard UniversityHandout 2 24 February 2004Solutions to Problem Set 1Problem 1. For this exercise it is necessary to assume that all utility is counted in Dollar terms. 1(a) Your roommate can choose between two acti
Academy of Art University - DFDAS - 220
Ec1052: Introduction to Game Theory Harvard UniversityHandout 4 10 March 2004Solutions to Problem Set 2Problem 1. Assume, that both lawyers can order the appetizer or the main course, and that they both have utility 10 and 15 over both dishes respectiv
Academy of Art University - DFDAS - 220
Ec1052: Introduction to Game Theory Harvard UniversityHandout 6 20 March 2004Solutions to Problem Set 3Problem 1. The following game matrix shows a generic way to capture the gist of the story in a 2 by 2 game. The teacher gets utility l from the stude
Academy of Art University - DFDAS - 220
Ec1052: Introduction to Game Theory Harvard UniversityHandout 11 28 April 2004Solutions to Problem Set 4Problem 1. There is no right answer to this one. We have shown in previous problem sets that the Nash equilibrium (NE) is stronger than iterated del
Academy of Art University - DFDAS - 220
Ec1052: Introduction to Game Theory Harvard UniversityHandout 12.5 9 May 2004Solutions to Problem Set 5Problem 1. 1(a) Omitted. 1(b) The trust game has a unique SPE. Player 2 sends no money back and, anticipating this strategy, player 1 sends no money
Academy of Art University - DFDAS - 220
Ec1052: Introduction to Game Theory Harvard UniversityHandout 15 9 May 2004Solutions to Problem Set 6Problem 1. 1(a) Your optimal bid is 0. If you bid any positive value and you win the object then the value was between 0 and your bid b. Hence the expe
Academy of Art University - DFDAS - 220
CGA-CANADA FINANCIAL ACCOUNTING 1 EXAMINATION June 2004 Marks9Time: 3 HoursQuestion 1 Select the best answer for each of the following unrelated items. Answer each of these items in your examination booklet by giving the number of your choice. For exam
Academy of Art University - DFDAS - 220
FINANCIAL ACCOUNTING 1 [FA1] EXAMINATIONBefore starting to write the examination, make sure that it is complete and that there are no printing defects. This examination consists of 8 pages. There are 10 questions for a total of 100 marks.READ THE QUESTI
Academy of Art University - DFDAS - 220
CGA-CANADA FINANCIAL ACCOUNTING 1 EXAMINATION June 2003 Marks12Time: 3 HoursQuestion 1 Select the best answer for each of the following unrelated items. Answer each of these items in your examination booklet by giving the number of your choice. For exa
Academy of Art University - DFDAS - 220
CGA-CANADA FINANCIAL ACCOUNTING 1 EXAMINATION December 2003 Marks9Time: 3 HoursQuestion 1 Select the best answer for each of the following unrelated items. Answer each of these items in your examination booklet by giving the number of your choice. For
Academy of Art University - DFDAS - 220
CGA-CANADA FINANCIAL ACCOUNTING 1 EXAMINATION March 2004 Marks9Time: 3 HoursQuestion 1 Select the best answer for each of the following unrelated items. Answer each of these items in your examination booklet by giving the number of your choice. For exa
UCLA - CS - 32
Programming Assignment 1Attack of the RobotsTime due: 9:00 PM Tuesday, January 17The appendix to this document is the specification of the last CS 31 project from last quarter.We will provide you with a correct1 solution to that project. Your assignme
UCLA - CS - 32
Project #3ScentipedeFor questions about this project, first consult your TA.If your TA cant help, ask Professor Nachenberg.Time due:Part 1: 9 PM, Sunday, February 26Part 2: 9 PM, Thursday, March 1Note: We understand that Spiders and Scorpions are n
UCLA - CS - 32
FinalExamReview FinalExamTopicsRecursionBigOSorting(slowandefficientsortingalgorithms)Trees(linkedlist&arraybased) Traversals BinarySearchTrees Searching,Inserting,Deleting,etc. Tables,HashTables,Load,etc. PriorityQueues,HeapsandHeapSort Graphs
UCLA - CS - 32
Lecture#1Professor:CareyNachenberg(PleasecallmeCarey)Email:climberkip@gmail.comClassinfo:MW10am12pm,3400BoelterHallOfficehours:TBDin4531NBoelterHallPicka#between16016 21 26 31 52 5717 22 27 48 53 5818 23 28 49 54 5919 24 29 50255 60 31 42 51 11
UCLA - CS - 32
Wednesday,Jan11 thCollectAcademicIntegrityFormsConstructorsDestructorsClassCompositionCompositionwithInitializerListsAfewfinaltopicsrequiredforProject#1LearninghowtousetheVCdebugger(timepermitting)Constructors:ClassInitializationEveryclassshoul
UCLA - CS - 32
CS32 Project Alert!Hint #1: Read the entire projectspec before starting; it has lots of clues!Hint #2: Dont freak out!Hint #3: Work incrementally. Get one thing towork at a time!Hint #4: Start early! This project will probablytake 30+ hours!Hint #
UCLA - CS - 32
CS32 Winter 2012Project #4Ad HunterDue: 9 PM Thursday, March 15Make sure to read the entire document (especially Requirements and Other Thoughts)before starting your project.For questions about this project, contact Carey Nachenberg: climberkip@gmai
UCLA - MATH - 31B
UCLA - MATH - 31B
HomeworkHomework 1, due September 307.1: 18, 36, 39, 46, 58, 59, 82, 83, 86, 907.2: 16, 17, 18, 23, 29, 31, 33, 35, 36, 39, 41, 427.3: 12, 13, 15, 24, 28, 38, 39, 42, 44, 46, 71, 72, 92, 96, 100, 101, 111, 118Homework 2, due October 77.4: 9, 14, 20,
UCLA - MATH - 31B
Math 31B, Lecture 4, Fall 2011Exam #1, 17 October 2011Name:ID Number:Section and TA: You have 50 minutes for the exam. No calculators, phones, notes, or books allowed. You must show your work for credit.Question:1234567TotalPoints:8131
UCLA - MATH - 31B
Math 31B, Lecture 4, Fall 2011Exam #2, 9 November 2011Name:ID Number:Section and TA: You have 50 minutes for the exam. No calculators, phones, notes, or books allowed. You must show your work for credit. Hint:nn=0 crQuestion:1234567Tota
UCLA - CS - 31
4.Yourhighschoolfriendwhodidn'tmakeittoUCLAandsettledforauniversitycalledU$Csentyouthe FinalPracticefollowingmessagethroughFacebook:TA:BrianChoi(schoi@cs.ucla.edu)SectionWebpage:http:/www.cs.ucla.edu/~schoi/cs31Hey,Iwrotethefollowingfunction,countMa
UCLA - CS - 31
Programming Assignment 5Mystery WordTime due: 9:00 PM Tuesday, November 15You have been contracted by the producers of the highly-rated Mystery Word TVgame show to write a program that lets fans play a home version of the game. Here'show one round of
UCLA - CS - 31
Fall 2011 CS 31Programming Assignment 2Phoney BaloneyTime due: 9:00 PM Thursday, October 13 Saturday, October 15Before you ask questions about this specification, see if your question has already been addressed bythe Project 2 FAQ. And read the FAQ b
UCLA - CS - 31
Programming Assignment 3Scram, Spam!Time due: 9:00 PM Thursday, October 27Before you ask questions about this specification, see if your question has already been addressed bythe Project 3 FAQ. And read the FAQ before you turn in this project, to be s
UCLA - CS - 31
Programming Assignment 4Array of SunshineTime due: 9:00 PM Thursday, November 3Before you ask questions about this specification, see if your question has already been addressed bythe Project 4 FAQ. And read the FAQ before you turn in this project, to
UCLA - CS - 31
Project 6What's the Point?Time due: 9:00 PM Tuesday, November 22This project is designed to help you master pointers. To that end, you'll get the mostout of it by working through the problems by hand. Only after that should you resortto running the p