CS 4407 Algorithms Greedy Algorithms and Minimum Spanning Trees
|
|
- Donald Barnett
- 6 years ago
- Views:
Transcription
1 CS 4407 Algorithms Greedy Algorithms and Minimum Spanning Trees Prof. Gregory Provan Department of Computer Science University College Cork 1
2 Sample MST
3 Greedy Algorithms When are greedy algorithms optimal? Must satisfy the optimal substructure property Optimal sub-problem must participate in optimal problem
4 What makes a greedy algorithm? Feasible Has to satisfy the problem s constraints Locally Optimal The greedy part Has to make the best local choice among all feasible choices available on that step If this local choice results in a global optimum then the problem has optimal substructure Irrevocable Once a choice is made it can t be un-done on subsequent steps of the algorithm Simple examples: Playing chess by making best move without lookahead Giving fewest number of coins as change Simple and appealing, but don t always give the best solution
5 Definition Spanning Tree A spanning tree of a graph G is a tree (acyclic) that connects all the vertices of G once i.e. the tree spans every vertex in G A Minimum Spanning Tree (MST) is a spanning tree on a weighted graph that has the minimum total weight such that w(t) is minimum w( T ) = w( u, v) u, v T
6 Sample MST Which links to make this a MST? Optimal substructure: A subtree of the MST must in turn be a MST of the nodes that it spans.
7 MST Claim Claim: Say that M is a MST If we remove any edge (u,v) from M then this results in two trees, T1 and T2. T1 is a MST of its subgraph while T2 is a MST of its subgraph. Then the MST of the entire graph is T1 + T2 + the smallest edge between T1 and T2 If some other edge was used, we wouldn t have the minimum spanning tree overall
8 Greedy Algorithm We can use a greedy algorithm to find the MST. Two common algorithms Kruskal Prim
9 Example: Kruskal s MST Algorithm Idea: Greedily construct the MST Go through the list of edges and make a forest that is a MST At each vertex, sort the edges Edges with smallest weights examined and possibly added to MST before edges with higher weights Edges added must be safe edges that do not ruin the tree property.
10 Activity-Selection Problem Problem: get your money s worth out of a carnival Buy a wristband that lets you onto any ride Lots of rides, each starting and ending at different times Your goal: ride as many rides as possible Another, alternative goal that we don t solve here: maximize time spent on rides Welcome to the activity selection problem
11 Formally: Activity-Selection Given a set S of n activities s i = start time of activity i f i = finish time of activity i Find max-size subset A of compatible activities Assume (wlog) that f 1 f 2 f n
12 Activity Selection Problem Problem: Schedule an exclusive resource in competition with other entities. Formal Definition: Set S={1,2, n} of activities. Each activity has a start time s i and a finish time f j, where s i <f j. Activities i and j are compatible if they do not overlap. The activity selection problem select a maximum-size set of mutually compatible activities.
13 Greedy Choice Property Activity selection problem exhibits the greedy choice property: Locally optimal choice globally optimal sol n Theorem: if S is an activity selection problem sorted by finish time, then optimal solution A S such that {1} A Sketch of proof: if optimal solution B that does not contain {1}, can always replace first activity in B with {1} (Why?). Same number of activities, thus optimal.
14 Activity Selection: A Greedy Algorithm So actual algorithm is simple: Sort the activities by finish time Schedule the first activity Then schedule the next activity in sorted list which starts after previous activity finishes Repeat until no more activities Intuition is even more simple: Always pick the shortest ride available at the time
15 Greedy Activity Selection Just march through each activity by finish time and schedule it if possible:
16 Activity Selection Example Schedule job 1, then try rest: (end up with 1, 4, 8): T=1 T=2 T=3 T=4 T=5 T=6 T=7 T=8 T=9 T=10 T=11 T=12 T= Runtime?
17 Activity Selection: Optimal Substructure Let k be the minimum activity in A (i.e., the one with the earliest finish time). Then A - {k} is an optimal solution to S = {i S: s i f k } In words: once activity #1 is selected, the problem reduces to finding an optimal solution for activity-selection over activities in S compatible with #1 Proof: if we could find optimal solution B to S with B > A - {k}, Then B U {k} is compatible And B U {k} > A
Minimum Spanning Tree Union-Find Data Structure. Feb 28, 2018 CSCI211 - Sprenkle. Comcast wants to lay cable in a neighborhood. Neighborhood Layout
Objec&ves Minimum Spanning Tree Union-Find Data Structure Feb, 0 CSCI - Sprenkle Started teasing out some algorithms. Laying Cable Focus on commonality: what should our final solution look like? Comcast
More informationEstimating the Margin of Victory for Instant-Runoff Voting
Estimating the Margin of Victory for Instant-Runoff Voting David Cary Abstract A general definition is proposed for the margin of victory of an election contest. That definition is applied to Instant Runoff
More informationPrim's MST Algorithm with step-by-step execution
Prim's MST Algorithm with step-by-step execution Daniel Michel Tavera Student at National Autonomous University of Mexico (UNAM) Mexico e-mail: daniel_michel@ciencias.unam.mx Social service project director:
More informationPolitical Districting for Elections to the German Bundestag: An Optimization-Based Multi-Stage Heuristic Respecting Administrative Boundaries
Political Districting for Elections to the German Bundestag: An Optimization-Based Multi-Stage Heuristic Respecting Administrative Boundaries Sebastian Goderbauer 1 Electoral Districts in Elections to
More informationDesigning police patrol districts on street network
Designing police patrol districts on street network Huanfa Chen* 1 and Tao Cheng 1 1 SpaceTimeLab for Big Data Analytics, Department of Civil, Environmental, and Geomatic Engineering, University College
More informationKruskal's MST Algorithm with step-by-step execution
Kruskal's MST Algorithm with step-by-step execution Daniel Michel Tavera Student at National Autonomous University of Mexico (UNAM) Mexico e-mail: daniel_michel@ciencias.unam.mx Social service project
More informationCoalitional Game Theory
Coalitional Game Theory Game Theory Algorithmic Game Theory 1 TOC Coalitional Games Fair Division and Shapley Value Stable Division and the Core Concept ε-core, Least core & Nucleolus Reading: Chapter
More informationApproval Voting Theory with Multiple Levels of Approval
Claremont Colleges Scholarship @ Claremont HMC Senior Theses HMC Student Scholarship 2012 Approval Voting Theory with Multiple Levels of Approval Craig Burkhart Harvey Mudd College Recommended Citation
More informationThe Australian Society for Operations Research
The Australian Society for Operations Research www.asor.org.au ASOR Bulletin Volume 34, Issue, (06) Pages -4 A minimum spanning tree with node index Elias Munapo School of Economics and Decision Sciences,
More informationSubreddit Recommendations within Reddit Communities
Subreddit Recommendations within Reddit Communities Vishnu Sundaresan, Irving Hsu, Daryl Chang Stanford University, Department of Computer Science ABSTRACT: We describe the creation of a recommendation
More informationEstimating the Margin of Victory for Instant-Runoff Voting*
Estimating the Margin of Victory for Instant-Runoff Voting* David Cary v7 * also known as Ranked-Choice Voting, preferential voting, and the alternative vote 1 Why estimate? Overview What are we talking
More informationSpatial Chaining Methods for International Comparisons of Prices and Real Expenditures D.S. Prasada Rao The University of Queensland
Spatial Chaining Methods for International Comparisons of Prices and Real Expenditures D.S. Prasada Rao The University of Queensland Jointly with Robert Hill, Sriram Shankar and Reza Hajargasht 1 PPPs
More informationNetworked Games: Coloring, Consensus and Voting. Prof. Michael Kearns Networked Life NETS 112 Fall 2013
Networked Games: Coloring, Consensus and Voting Prof. Michael Kearns Networked Life NETS 112 Fall 2013 Experimental Agenda Human-subject experiments at the intersection of CS, economics, sociology, network
More information17.1 Introduction. Giulia Massini and Massimo Buscema
Chapter 17 Auto-Contractive Maps and Minimal Spanning Tree: Organization of Complex Datasets on Criminal Behavior to Aid in the Deduction of Network Connectivity Giulia Massini and Massimo Buscema 17.1
More informationHASHGRAPH CONSENSUS: DETAILED EXAMPLES
HASHGRAPH CONSENSUS: DETAILED EXAMPLES LEEMON BAIRD BAIRD@SWIRLDS.COM DECEMBER 11, 2016 SWIRLDS TECH REPORT SWIRLDS-TR-2016-02 ABSTRACT: The Swirlds hashgraph consensus algorithm is explained through a
More informationA MINIMUM DISTANCE AND THE GENERALISED EKS APPROACHES TO MULTILATERAL COMPARISONS OF PRICES AND REAL INCOMES
A MINIMUM DISTANCE AND THE GENERALISED EKS APPROACHES TO MULTILATERAL COMPARISONS OF PRICES AND REAL INCOMES D.S. Prasada Rao Sriram Shankar School of Economics The University of Queensland Australia Golamreza
More informationSTUDY GUIDE FOR TEST 2
STUDY GUIDE FOR TEST 2 MATH 303. SPRING 2006. INSTRUCTOR: PROFESSOR AITKEN The test will cover Chapters 4, 5, and 6. Chapter 4: The Mathematics of Voting Sample Exercises: 1, 3, 5, 7, 8, 10, 14, 15, 17,
More informationSimple methods for single winner elections
Simple methods for single winner elections Christoph Börgers Mathematics Department Tufts University Medford, MA April 14, 2018 http://emerald.tufts.edu/~cborgers/ I have posted these slides there. 1 /
More informationComputational challenges in analyzing and moderating online social discussions
Computational challenges in analyzing and moderating online social discussions Aristides Gionis Department of Computer Science Aalto University Machine learning coffee seminar Oct 23, 2017 social media
More informationHat problem on a graph
Hat problem on a graph Submitted by Marcin Piotr Krzywkowski to the University of Exeter as a thesis for the degree of Doctor of Philosophy by Publication in Mathematics In April 2012 This thesis is available
More informationCSCI211: Intro Objectives
CSCI211: Intro Objectives Introduction to Algorithms, Analysis Course summary Reviewing proof techniques Jan 7, 2019 Sprenkle CSCI211 1 My Bio From Dallastown, PA B.S., Gettysburg College M.S., Duke University
More informationThe Effectiveness of Receipt-Based Attacks on ThreeBallot
The Effectiveness of Receipt-Based Attacks on ThreeBallot Kevin Henry, Douglas R. Stinson, Jiayuan Sui David R. Cheriton School of Computer Science University of Waterloo Waterloo, N, N2L 3G1, Canada {k2henry,
More informationHow hard is it to control sequential elections via the agenda?
How hard is it to control sequential elections via the agenda? Vincent Conitzer Department of Computer Science Duke University Durham, NC 27708, USA conitzer@cs.duke.edu Jérôme Lang LAMSADE Université
More informationConstraint satisfaction problems. Lirong Xia
Constraint satisfaction problems Lirong Xia Spring, 2017 Project 1 Ø You can use Windows Ø Read the instruction carefully, make sure you understand the goal search for YOUR CODE HERE Ø Ask and answer questions
More informationHyo-Shin Kwon & Yi-Yi Chen
Hyo-Shin Kwon & Yi-Yi Chen Wasserman and Fraust (1994) Two important features of affiliation networks The focus on subsets (a subset of actors and of events) the duality of the relationship between actors
More informationTitle: Adverserial Search AIMA: Chapter 5 (Sections 5.1, 5.2 and 5.3)
B.Y. Choueiry 1 Instructor s notes #9 Title: dverserial Search IM: Chapter 5 (Sections 5.1, 5.2 and 5.3) Introduction to rtificial Intelligence CSCE 476-876, Fall 2017 URL: www.cse.unl.edu/ choueiry/f17-476-876
More informationVoting and Complexity
Voting and Complexity legrand@cse.wustl.edu Voting and Complexity: Introduction Outline Introduction Hardness of finding the winner(s) Polynomial systems NP-hard systems The minimax procedure [Brams et
More informationCS269I: Incentives in Computer Science Lecture #4: Voting, Machine Learning, and Participatory Democracy
CS269I: Incentives in Computer Science Lecture #4: Voting, Machine Learning, and Participatory Democracy Tim Roughgarden October 5, 2016 1 Preamble Last lecture was all about strategyproof voting rules
More informationVoting Methods
1.3-1.5 Voting Methods Some announcements Homework #1: Text (pages 28-33) 1, 4, 7, 10, 12, 19, 22, 29, 32, 38, 42, 50, 51, 56-60, 61, 65 (this is posted on Sakai) Math Center study sessions with Katie
More informationDo two parties represent the US? Clustering analysis of US public ideology survey
Do two parties represent the US? Clustering analysis of US public ideology survey Louisa Lee 1 and Siyu Zhang 2, 3 Advised by: Vicky Chuqiao Yang 1 1 Department of Engineering Sciences and Applied Mathematics,
More informationEconomics 470 Some Notes on Simple Alternatives to Majority Rule
Economics 470 Some Notes on Simple Alternatives to Majority Rule Some of the voting procedures considered here are not considered as a means of revealing preferences on a public good issue, but as a means
More informationAn example of public goods
An example of public goods Yossi Spiegel Consider an economy with two identical agents, A and B, who consume one public good G, and one private good y. The preferences of the two agents are given by the
More informationCyber-Physical Systems Scheduling
Cyber-Physical Systems Scheduling ICEN 553/453 Fall 2018 Prof. Dola Saha 1 Quick Recap 1. What characterizes the memory architecture of a system? 2. What are the issues with heaps in embedded/real-time
More informationIntroduction to Computational Game Theory CMPT 882. Simon Fraser University. Oliver Schulte. Decision Making Under Uncertainty
Introduction to Computational Game Theory CMPT 882 Simon Fraser University Oliver Schulte Decision Making Under Uncertainty Outline Choice Under Uncertainty: Formal Model Choice Principles o Expected Utility
More informationOn the Complexity of Voting Manipulation under Randomized Tie-Breaking
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence On the Complexity of Voting Manipulation under Randomized Tie-Breaking Svetlana Obraztsova Edith Elkind School
More information(67686) Mathematical Foundations of AI June 18, Lecture 6
(67686) Mathematical Foundations of AI June 18, 2008 Lecturer: Ariel D. Procaccia Lecture 6 Scribe: Ezra Resnick & Ariel Imber 1 Introduction: Social choice theory Thus far in the course, we have dealt
More informationVoting-Based Group Formation
Proceedings of the Twenty-Fifth International Joint Conference on Artificial Intelligence (IJCAI-16) Voting-Based Group Formation Piotr Faliszewski AGH University Krakow, Poland faliszew@agh.edu.pl Arkadii
More informationConnecting Voting Theory and Graph Theory
Connecting Voting Theory and Graph Theory Karl-Dieter Crisman Gordon College Willamette University Math Colloquium, October 13, 2016 Karl-Dieter Crisman (Gordon College) Graphs and Voting WU Colloquium
More informationTengyu Ma Facebook AI Research. Based on joint work with Yuanzhi Li (Princeton) and Hongyang Zhang (Stanford)
Tengyu Ma Facebook AI Research Based on joint work with Yuanzhi Li (Princeton) and Hongyang Zhang (Stanford) Ø Over-parameterization: # parameters # examples Ø a set of parameters that can Ø fit to training
More informationEstimating the Margin of Victory for an IRV Election Part 1 by David Cary November 6, 2010
Summary Estimating the Margin of Victory for an IRV Election Part 1 by David Cary November 6, 2010 New procedures are being developed for post-election audits involving manual recounts of random samples
More informationA Network Theory of Military Alliances
A Network Theory of Military Alliances Yuke Li April 12, 214 Abstract This paper introduces network game theory into the study of international relations and specifically, military alliances. Using concepts
More informationProcesses. Criteria for Comparing Scheduling Algorithms
1 Processes Scheduling Processes Scheduling Processes Don Porter Portions courtesy Emmett Witchel Each process has state, that includes its text and data, procedure call stack, etc. This state resides
More informationSection Voting Methods. Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 15.1 Voting Methods What You Will Learn Plurality Method Borda Count Method Plurality with Elimination Pairwise Comparison Method Tie Breaking 15.1-2 Example 2: Voting for the Honor Society President
More informationRandomized Pursuit-Evasion in Graphs
Randomized Pursuit-Evasion in Graphs Micah Adler, Harald Räcke ¾, Naveen Sivadasan, Christian Sohler ¾, and Berthold Vöcking ¾ Department of Computer Science University of Massachusetts, Amherst, micah@cs.umass.edu
More informationarxiv: v1 [cs.gt] 11 Jul 2018
Sequential Voting with Confirmation Network Yakov Babichenko yakovbab@tx.technion.ac.il Oren Dean orendean@campus.technion.ac.il Moshe Tennenholtz moshet@ie.technion.ac.il arxiv:1807.03978v1 [cs.gt] 11
More informationPatterns in Congressional Earmarks
Patterns in Congressional Earmarks Chris Musialek University of Maryland, College Park 8 November, 2012 Introduction This dataset from Taxpayers for Common Sense captures Congressional appropriations earmarks
More informationCongressional samples Juho Lamminmäki
Congressional samples Based on Congressional Samples for Approximate Answering of Group-By Queries (2000) by Swarup Acharyua et al. Data Sampling Trying to obtain a maximally representative subset of the
More informationCSRS Artist-in-Residence Fellowship
CSRS Artist-in-Residence Fellowship 2018-2019 The Centre for Studies in Religion and Society (CSRS) welcomes applications from artists interested in participating in our dynamic interdisciplinary research
More informationComparison Sorts. EECS 2011 Prof. J. Elder - 1 -
Comparison Sorts - 1 - Sorting Ø We have seen the advantage of sorted data representations for a number of applications q Sparse vectors q Maps q Dictionaries Ø Here we consider the problem of how to efficiently
More informationQuant 101 Learn2Quant HK, 14 September Vinesh Jha CEO, ExtractAlpha
Quant 101 Learn2Quant HK, 14 September 2017 Vinesh Jha CEO, ExtractAlpha Data-driven investment is the future ExtractAlpha confidential. Do not copy or distribute. 2 Agenda Ø Quick intro to ExtractAlpha
More informationPolitics is the subset of human behavior that involves the use of power or influence.
What is Politics? Politics is the subset of human behavior that involves the use of power or influence. Power is involved whenever individuals cannot accomplish their goals without either trying to influence
More informationPredicting Information Diffusion Initiated from Multiple Sources in Online Social Networks
Predicting Information Diffusion Initiated from Multiple Sources in Online Social Networks Chuan Peng School of Computer science, Wuhan University Email: chuan.peng@asu.edu Kuai Xu, Feng Wang, Haiyan Wang
More informationRandomized Pursuit-Evasion in Graphs
Randomized Pursuit-Evasion in Graphs Micah Adler Harald Räcke Ý Naveen Sivadasan Þ Christian Sohler Ý Berthold Vöcking Þ Abstract We analyze a randomized pursuit-evasion game on graphs. This game is played
More informationThe Political Economy of Trade Policy
The Political Economy of Trade Policy 1) Survey of early literature The Political Economy of Trade Policy Rodrik, D. (1995). Political Economy of Trade Policy, in Grossman, G. and K. Rogoff (eds.), Handbook
More informationStrategy in Law and Business Problem Set 1 February 14, Find the Nash equilibria for the following Games:
Strategy in Law and Business Problem Set 1 February 14, 2006 1. Find the Nash equilibria for the following Games: A: Criminal Suspect 1 Criminal Suspect 2 Remain Silent Confess Confess 0, -10-8, -8 Remain
More informationBribery in voting with CP-nets
Ann Math Artif Intell (2013) 68:135 160 DOI 10.1007/s10472-013-9330-5 Bribery in voting with CP-nets Nicholas Mattei Maria Silvia Pini Francesca Rossi K. Brent Venable Published online: 7 February 2013
More informationJUDGE, JURY AND CLASSIFIER
JUDGE, JURY AND CLASSIFIER An Introduction to Trees 15.071x The Analytics Edge The American Legal System The legal system of the United States operates at the state level and at the federal level Federal
More informationSection Voting Methods. Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 15.1 Voting Methods What You Will Learn Plurality Method Borda Count Method Plurality with Elimination Pairwise Comparison Method Tie Breaking 15.1-2 Example 2: Voting for the Honor Society President
More informationEconomics 320F An Economic Analysis of Law Midterm Exam Suggested Answers
Economics 320F An Economic Analysis of Law Midterm Exam Suggested Answers Fall 2003 University of Toronto Joanne Roberts Please answer all parts of the exam in the exam booklet provided. Calculators are
More informationComputational Social Choice: Spring 2017
Computational Social Choice: Spring 2017 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today So far we saw three voting rules: plurality, plurality
More informationNEW YORK CITY COLLEGE OF TECHNOLOGY The City University of New York
NEW YORK CITY COLLEGE OF TECHNOLOGY The City University of New York DEPARTMENT: Mathematics COURSE: MAT 2440/ MA 440 TITLE: DESCRIPTION: TEXTS: Discrete Structures and Algorithms I This course introduces
More informationCase Study: Border Protection
Chapter 7 Case Study: Border Protection 7.1 Introduction A problem faced by many countries is that of securing their national borders. The United States Department of Homeland Security states as a primary
More informationThe Constitution. Name: The Law of the Land. What Does Our Constitution Look Like?
The Law of the Land A constitution is a document that gives the rules for how a government should run. The Framers wrote our Constitution to create a government for the new United States of America. Creating
More informationautonomous agents Onn Shehory Sarit Kraus fshechory, Abstract
Formation of overlapping coalitions for precedence-ordered task-execution among autonomous agents Onn Shehory Sarit Kraus Department of Mathematics and Computer Science Bar Ilan University Ramat Gan, 52900
More informationCloning in Elections 1
Cloning in Elections 1 Edith Elkind, Piotr Faliszewski, and Arkadii Slinko Abstract We consider the problem of manipulating elections via cloning candidates. In our model, a manipulator can replace each
More informationAggregating Dependency Graphs into Voting Agendas in Multi-Issue Elections
Proceedings of the Twenty-Second International Joint Conference on Artificial Intelligence Aggregating Dependency Graphs into Voting Agendas in Multi-Issue Elections Stéphane Airiau, Ulle Endriss, Umberto
More informationMidterm Review. EECS 2011 Prof. J. Elder - 1 -
Midterm Review - 1 - Topics on the Midterm Ø Data Structures & Object-Oriented Design Ø Run-Time Analysis Ø Linear Data Structures Ø The Java Collections Framework Ø Recursion Ø Trees Ø Priority Queues
More informationCSE 308, Section 2. Semester Project Discussion. Session Objectives
CSE 308, Section 2 Semester Project Discussion Session Objectives Understand issues and terminology used in US congressional redistricting Understand top-level functionality of project system components
More informationSection Voting Methods. Copyright 2013, 2010, 2007, Pearson, Education, Inc.
Section 15.1 Voting Methods INB Table of Contents Date Topic Page # February 24, 2014 Test #3 Practice Test 38 February 24, 2014 Test #3 Practice Test Workspace 39 March 10, 2014 Test #3 40 March 10, 2014
More informationLab 3: Logistic regression models
Lab 3: Logistic regression models In this lab, we will apply logistic regression models to United States (US) presidential election data sets. The main purpose is to predict the outcomes of presidential
More informationRandom Forests. Gradient Boosting. and. Bagging and Boosting
Random Forests and Gradient Boosting Bagging and Boosting The Bootstrap Sample and Bagging Simple ideas to improve any model via ensemble Bootstrap Samples Ø Random samples of your data with replacement
More informationAdapting the Social Network to Affect Elections
Adapting the Social Network to Affect Elections Sigal Sina Dept of Computer Science Bar Ilan University, Israel sinasi@macs.biu.ac.il Noam Hazon Dept of Computer Science and Mathematics Ariel University,
More informationA comparative analysis of subreddit recommenders for Reddit
A comparative analysis of subreddit recommenders for Reddit Jay Baxter Massachusetts Institute of Technology jbaxter@mit.edu Abstract Reddit has become a very popular social news website, but even though
More informationWind power integration and consumer behavior: a complementarity approach
1 Wind power integration and consumer behavior: a complementarity approach 8 th Annual Trans-Atlantic INFRADAY Conference on Energy November 7 th, 2014 Ali Daraeepour, Duke University Dr. Jalal Kazempour,
More informationarxiv: v2 [math.ho] 12 Oct 2018
PHRAGMÉN S AND THIELE S ELECTION METHODS arxiv:1611.08826v2 [math.ho] 12 Oct 2018 SVANTE JANSON Abstract. The election methods introduced in 1894 1895 by Phragmén and Thiele, and their somewhat later versions
More informationGame Theory. Jiang, Bo ( 江波 )
Game Theory Jiang, Bo ( 江波 ) Jiang.bo@mail.shufe.edu.cn Mechanism Design in Voting Majority voting Three candidates: x, y, z. Three voters: a, b, c. Voter a: x>y>z; voter b: y>z>x; voter c: z>x>y What
More informationRed Oak Strategic Presidential Poll
Red Oak Strategic Presidential Poll Fielded 9/1-9/2 Using Google Consumer Surveys Results, Crosstabs, and Technical Appendix 1 This document contains the full crosstab results for Red Oak Strategic s Presidential
More informationSearch Trees. Chapter 10. CSE 2011 Prof. J. Elder Last Updated: :51 PM
Search Trees Chapter 1 < 6 2 > 1 4 = 8 9-1 - Outline Ø Binary Search Trees Ø AVL Trees Ø Splay Trees - 2 - Binary Search Trees Ø A binary search tree is a binary tree storing key-value entries at its internal
More informationFairness Criteria. Review: Election Methods
Review: Election Methods Plurality method: the candidate with a plurality of votes wins. Plurality-with-elimination method (Instant runoff): Eliminate the candidate with the fewest first place votes. Keep
More information5. Markets and the Environment
5. Markets and the Environment 5.1 The First Welfare Theorem Central question of interest: can an unregulated market be relied upon to allocate natural capital efficiently? The first welfare theorem: in
More informationThe perception of corruption in health: AutoCM methods for an international comparison
The perception of corruption in health: AutoCM methods for an international comparison Paolo Massimo Buscema, Lara Gitto, Simone Russo, Andrea Marcellusi, Federico Fiori, Guido Maurelli, Giulia Massini
More informationA New Method of the Single Transferable Vote and its Axiomatic Justification
A New Method of the Single Transferable Vote and its Axiomatic Justification Fuad Aleskerov ab Alexander Karpov a a National Research University Higher School of Economics 20 Myasnitskaya str., 101000
More informationThe Constitution. Name: The Law of the Land. What Does Our Constitution Look Like? The Constitution s Table of Contents
The Law of the Land A constitution is a document that gives the rules for how a government should run. The Framers wrote our Constitution to create a government for the new United States of America. Creating
More informationA constraint based dependancy parser for Sanskrit
A constraint based dependancy parser for Sanskrit Amba Kulkarni apksh@uohyd.ernet.in Department of Sanskrit Studies University of Hyderabad Hyderabad 19 Feb 2010 Calicut University Page 1 Æ Ó - Ý Ý Ñ ÚÝ
More information16. How to Structure Large Models and Programs with Graph Structurings
Fakultät Informatik - Institut Software- und Multimediatechnik - Softwaretechnologie Prof. Aßmann - 16. How to Structure Large Models and Programs with Graph Structurings Prof. Dr. U. Aßmann Technische
More informationAn Integer Linear Programming Approach for Coalitional Weighted Manipulation under Scoring Rules
An Integer Linear Programming Approach for Coalitional Weighted Manipulation under Scoring Rules Antonia Maria Masucci, Alonso Silva To cite this version: Antonia Maria Masucci, Alonso Silva. An Integer
More informationGraph Structurings. 16. How to Structure Large Models - Obligatory Reading. Ø T. Fischer, Jörg Niere, L. Torunski, and Albert Zündorf, 'Story
Fakultät Informatik, Institut für Software- und Multimediatechnik, Lehrstuhl für Softwaretechnologie 16. How to Structure Large Models - Graph Structurings Prof. Dr. U. Aßmann Technische Universität Dresden
More informationDefinition: Institution public system of rules which defines offices and positions with their rights and duties, powers and immunities p.
RAWLS Project: to interpret the initial situation, formulate principles of choice, and then establish which principles should be adopted. The principles of justice provide an assignment of fundamental
More informationComputational social choice Combinatorial voting. Lirong Xia
Computational social choice Combinatorial voting Lirong Xia Feb 23, 2016 Last class: the easy-tocompute axiom We hope that the outcome of a social choice mechanism can be computed in p-time P: positional
More informationThe Constitution. Name: The Law of the Land. What Does Our Constitution Look Like?
The Law of the Land A constitution is a document that gives the rules for how a government should run. The Framers wrote our Constitution to create a government for the new United States of America. Creating
More informationRandom tie-breaking in STV
Random tie-breaking in STV Jonathan Lundell jlundell@pobox.com often broken randomly as well, by coin toss, drawing straws, or drawing a high card.) 1 Introduction The resolution of ties in STV elections
More informationEvaluation of Election Outcomes under Uncertainty
Evaluation of Election Outcomes under Uncertainty Noam Hazon, Yonatan umann, Sarit Kraus, Michael Wooldridge Department of omputer Science Department of omputer Science ar-ilan University University of
More informationMinnehaha County Election Review Committee
Minnehaha County Election Review Committee January 16, 2015 Meeting Meeting Notes: Attendees: Lorie Hogstad, Sue Roust, Julie Pearson, Kea Warne, Deb Elofson, Bruce Danielson, Joel Arends I. Call to Order
More informationUnit 03. Ngo Quy Nham Foreign Trade University
Unit 03 Ngo Quy Nham Foreign Trade University The process by which managers identify organisational problems and try to resolve them. Identifying a problem Identifying decision criteria Allocating weight
More informationPLS 540 Environmental Policy and Management Mark T. Imperial. Topic: The Policy Process
PLS 540 Environmental Policy and Management Mark T. Imperial Topic: The Policy Process Some basic terms and concepts Separation of powers: federal constitution grants each branch of government specific
More informationSocial Choice. CSC304 Lecture 21 November 28, Allan Borodin Adapted from Craig Boutilier s slides
Social Choice CSC304 Lecture 21 November 28, 2016 Allan Borodin Adapted from Craig Boutilier s slides 1 Todays agenda and announcements Today: Review of popular voting rules. Axioms, Manipulation, Impossibility
More informationComputational aspects of voting: a literature survey
Rochester Institute of Technology RIT Scholar Works Theses Thesis/Dissertation Collections 2007 Computational aspects of voting: a literature survey Fatima Talib Follow this and additional works at: http://scholarworks.rit.edu/theses
More informationJörg Rothe. Editor. Economics and Computation. An Introduction to Algorithmic Game. Theory, Computational Social Choice, and Fair Division
Jörg Rothe Editor Economics and Computation An Introduction to Algorithmic Game Theory, Computational Social Choice, and Fair Division Illustrations by Irene Rothe 4^ Springer Contents Foreword by Matthew
More informationParameterized Control Complexity in Bucklin Voting and in Fallback Voting 1
Parameterized Control Complexity in Bucklin Voting and in Fallback Voting 1 Gábor Erdélyi and Michael R. Fellows Abstract We study the parameterized control complexity of Bucklin voting and of fallback
More informationThe Complexity of Losing Voters
The Complexity of Losing Voters Tomasz Perek and Piotr Faliszewski AGH University of Science and Technology Krakow, Poland mat.dexiu@gmail.com, faliszew@agh.edu.pl Maria Silvia Pini and Francesca Rossi
More information