JV Morales

Part V Theorems about Voting Methods

JV Morales

Part V Theorems about Voting Methods

2:26

Part IVb Hare System, Borda Count, Sequential Pairwise, and Approval Voting

JV Morales

Part IVb Hare System, Borda Count, Sequential Pairwise, and Approval Voting

10:26

Part IVa Majority Rule Method and Condorcet Method

JV Morales

Part IVa Majority Rule Method and Condorcet Method

8:43

Part III Plurality Method is Vulnerable to Strategic Voting

JV Morales

Part III Plurality Method is Vulnerable to Strategic Voting

2:17

Part IIb Plurality Method satisfies Pareto and Monotonicty but not IIA

JV Morales

Part IIb Plurality Method satisfies Pareto and Monotonicty but not IIA

6:56

Part IIa Plurality Method Satisfies Majority Criterion but not Condorcet Criterion

JV Morales

Part IIa Plurality Method Satisfies Majority Criterion but not Condorcet Criterion

7:58

Part I Overview and preliminary concepts

JV Morales

Part I Overview and preliminary concepts

6:35

Part IV UPC and QR Codes

JV Morales

Part IV UPC and QR Codes

9:07

Part IIIc Hamming Codes

JV Morales

Part IIIc Hamming Codes

9:43

Part IIIb Repetition Codes

JV Morales

Part IIIb Repetition Codes

6:16

Part IIIa Parity Check Codes

JV Morales

Part IIIa Parity Check Codes

6:28

Part IIc Terms to Understand

JV Morales

Part IIc Terms to Understand

3:23

Part IIb Some Applications of Coding Theory

JV Morales

Part IIb Some Applications of Coding Theory

4:23

Part IIa Basic Problems in Coding Theory

JV Morales

Part IIa Basic Problems in Coding Theory

8:37

Part I Review on Divisibility and Modular Arithmetic

JV Morales

Part I Review on Divisibility and Modular Arithmetic

4:03

Part III Analyzing sequential games by backward induction

JV Morales

Part III Analyzing sequential games by backward induction

11:41

Part IIb Analyzing the game using Nash Equilibrium

JV Morales

Part IIb Analyzing the game using Nash Equilibrium

10:33

Part IIc Dominant Strategy Equilibirum and IEDS

JV Morales

Part IIc Dominant Strategy Equilibirum and IEDS

16:11

Part IIa Analyzing the game using Maximin solution

JV Morales

Part IIa Analyzing the game using Maximin solution

11:40

Part Ic Constructing the normal form a game

JV Morales

Part Ic Constructing the normal form a game

11:21

Part Ib Preliminary Concepts

JV Morales

Part Ib Preliminary Concepts

12:13

Part Ia Prisoner's Dilemma

JV Morales

Part Ia Prisoner's Dilemma

2:26

Part IV Dijkstra's Algorithm Example 2

JV Morales

Part IV Dijkstra's Algorithm Example 2

8:29

Part III Dijkstra's Algorithm Example 1

JV Morales

Part III Dijkstra's Algorithm Example 1

17:20

Part II Preliminary Concepts on Graph Theory

JV Morales

Part II Preliminary Concepts on Graph Theory

16:40

Part I Overview and Origin of Graph Theory

JV Morales

Part I Overview and Origin of Graph Theory

8:24

Part V Example 2

JV Morales

Part V Example 2

9:41

Part IV Stepping Stone Method Example 1

JV Morales

Part IV Stepping Stone Method Example 1

9:31

Part III Closed Polygonal Path and Improvement Indices

JV Morales

Part III Closed Polygonal Path and Improvement Indices

9:32

Part II Northwest Corner Rule Example 1

JV Morales

Part II Northwest Corner Rule Example 1

6:38

Part I Overview of Transportation Problem

JV Morales

Part I Overview of Transportation Problem

8:40

Part IV Unbalanced Problem

JV Morales

Part IV Unbalanced Problem

3:48

Part III Maximizing Profit Balanced

JV Morales

Part III Maximizing Profit Balanced

10:51

Part II Minimizing Cost Balanced

JV Morales

Part II Minimizing Cost Balanced

14:23

Part I Overview of Assignment Problems

JV Morales

Part I Overview of Assignment Problems

3:42

Part IV More Example

JV Morales

Part IV More Example

11:04

Part IIIb Example 1: Solving by finding feasible region and corner-point principle

JV Morales

Part IIIb Example 1: Solving by finding feasible region and corner-point principle

5:50

Part IIIa Example 1: Converting word problem to linear programming model

JV Morales

Part IIIa Example 1: Converting word problem to linear programming model

7:06

Part II Basic Components of Linear Programming Models

JV Morales

Part II Basic Components of Linear Programming Models

3:59

Part I Review

JV Morales

Part I Review

13:23

Part IIIb Rules of Inference

JV Morales

Part IIIb Rules of Inference

15:37

Part IVb Proof of Validity

JV Morales

Part IVb Proof of Validity

12:08

Part IVa Test Your Knowledge of Rules of Inference

JV Morales

Part IVa Test Your Knowledge of Rules of Inference

4:36

Part IIIa Logical Equivalence, Tautology, Contradiction, and Contingency

JV Morales

Part IIIa Logical Equivalence, Tautology, Contradiction, and Contingency

11:21

Part IId Biconditionals

JV Morales

Part IId Biconditionals

8:04

Part IIc Implications

JV Morales

Part IIc Implications

9:15

Part IIb Inclusive and Exclusive Or

JV Morales

Part IIb Inclusive and Exclusive Or

7:24

Part IIa Negation and Conjunction

JV Morales

Part IIa Negation and Conjunction

8:45

Part I What is a Proposition

JV Morales

Part I What is a Proposition

4:14

次のページ