Power in voting games: axiomatic and probabilistic approaches

Size: px
Start display at page:

Download "Power in voting games: axiomatic and probabilistic approaches"

Transcription

1 : axiomatic and probabilistic approaches a a Department of Mathematics Technical Universit of Catalonia Summer School, Campione d Italia Game Theor and Voting Sstems

2 Outline Power indices, several interpretations 1 Power indices, several interpretations Probabilit distribution Barr s equation: Dube and Shaple s equation

3 Notion(s) of power What do ou want to measure?

4 Notion(s) of power What do ou want to measure? Depending on our answer we should look for a suitable tool.

5 Notion(s) of power What do ou want to measure? Depending on our answer we should look for a suitable tool. An open definition of power...

6 Notion(s) of power What do ou want to measure? Depending on our answer we should look for a suitable tool. An open definition of power... Roughl speaking... a power index is a numerical measure that estimates the a priori... of each voter in a simple game. What could the... be?

7 What do ou want to measure? Several options: :

8 What do ou want to measure? Several options: : divide a cake (P-power)

9 What do ou want to measure? Several options: : divide a cake (P-power) Decisiveness as influence:

10 What do ou want to measure? Several options: : divide a cake (P-power) Decisiveness as influence: a priori influence capacit to make decisions in a committee (I-power)

11 What do ou want to measure? Several options: : divide a cake (P-power) Decisiveness as influence: a priori influence capacit to make decisions in a committee (I-power) Success:

12 What do ou want to measure? Several options: : divide a cake (P-power) Decisiveness as influence: a priori influence capacit to make decisions in a committee (I-power) Success: expectation to achieve the desired result

13 What do ou want to measure? Several options: : divide a cake (P-power) Decisiveness as influence: a priori influence capacit to make decisions in a committee (I-power) Success: expectation to achieve the desired result Inclusiveness:

14 What do ou want to measure? Several options: : divide a cake (P-power) Decisiveness as influence: a priori influence capacit to make decisions in a committee (I-power) Success: expectation to achieve the desired result Inclusiveness: expectation to be part in the winning side

15 What do ou want to measure? Several options: : divide a cake (P-power) Decisiveness as influence: a priori influence capacit to make decisions in a committee (I-power) Success: expectation to achieve the desired result Inclusiveness: expectation to be part in the winning side Luckiness, etc.

16 Measuring decisiveness as a paoff: P-power The propert of efficienc ( i N ψ i = 1) for P-power seems inescapable. Thus, it is a requirement rather than an axiom. Axiomatic approach: Properties for a power index ψ : S N R n :

17 Measuring decisiveness as a paoff: P-power The propert of efficienc ( i N ψ i = 1) for P-power seems inescapable. Thus, it is a requirement rather than an axiom. Axiomatic approach: Properties for a power index ψ : S N R n : Efficienc, If i is a null voter then ψ i [W ] = 0, If i and j are equivalent voters then ψ i [W ] = ψ j [W ] If W and W are two games, consider W W and W W. Then ψ[w ] + ψ[w ] = ψ[w W ] + ψ[w W ] How man indices exist with these properties?

18 ...onl one! the Shaple Shubik index which is the restriction to simple games of the Shaple value for cooperative games. Formulation for simple games, W a are the winning coalitions SS a [W ] = S:S / W, S {a} W s!(n s 1)! n! ( S = s)

19 ...onl one! the Shaple Shubik index which is the restriction to simple games of the Shaple value for cooperative games. Formulation for simple games, W a are the winning coalitions SS a [W ] = S:S / W, S {a} W s!(n s 1)! n! ( S = s) Probabilistic approach: derivation of the model from a bargaining model

20 Shaple value bargaining model, v(s) v(s {a}) s s + 1 a s + 2 n Comment: Rationalit of plaers + superadditivit stimulate the formation of N and to divide revenues or costs according to the Shaple value. Question: Is the probabilistic model provided a convincing argument for cooperative games?

21 Shaple value bargaining model, v(s) v(s {a}) s s + 1 a s + 2 n Comment: Rationalit of plaers + superadditivit stimulate the formation of N and to divide revenues or costs according to the Shaple value. Question: Is the probabilistic model provided a convincing argument for cooperative games? es

22 Shaple value bargaining model, v(s) v(s {a}) s s + 1 a s + 2 n Comment: Rationalit of plaers + superadditivit stimulate the formation of N and to divide revenues or costs according to the Shaple value. Question: Is the probabilistic model provided a convincing argument for cooperative games? es and for the restriction to simple games?

23 Shaple value bargaining model, v(s) v(s {a}) s s + 1 a s + 2 n Comment: Rationalit of plaers + superadditivit stimulate the formation of N and to divide revenues or costs according to the Shaple value. Question: Is the probabilistic model provided a convincing argument for cooperative games? es and for the restriction to simple games?...mabe not

24 Standard formula for both S-value and SS-index 1 2 s! (n s 1)! s s + 1 a s + 2 n Well-known formula b taking common factors: The Shaple value φ is given b φ a (v) = s!(n s 1)! [v(s {a}) v(s)] n! S 2 N\{a} for an a N, where s = S.

25 The S&S bargaining model for the S&S index, Assume that all orderings of voters are equall probable. 2 Assume that everbod votes es in his/her turn. 3 A plaer is pivotal if the coalition of his/her predecessors in the queue is losing and his/her addition to it does the new coalition winning. The S&S index is the probabilit of being pivotal under de above scheme, or equivalentl it is the expected value of the marginal contributions under this scheme.

26 1 2 LOSING WINNING s s + 1 a s + 2 n Question: Is this the most natural probabilistic scheme for the index?

27 1 2 LOSING WINNING s s + 1 a s + 2 n Question: Is this the most natural probabilistic scheme for the index?...should it be possible for a voter to vote no?

28 Example Consider the 1958 EU voting sstem: [12; 4, 4, 4, 2, 2, 1] [6; 2, 2, 2, 1, 1, 0] B B B S S (we ignore the null voter because receives 0) a big countr is 4 times pivotal in the third position a big countr is 24 times pivotal in the fourth position. B

29 Example Consider the 1958 EU voting sstem: [12; 4, 4, 4, 2, 2, 1] [6; 2, 2, 2, 1, 1, 0] B B B S S (we ignore the null voter because receives 0) a big countr is 4 times pivotal in the third position a big countr is 24 times pivotal in the fourth position. Thus the power of a big countr is = 7, and the power of a small 30 countr is: 1 ( ) = B

30 Probabilistic approach The Shaple-Shubik index relies for its justification on the axiomatic derivation of the Shaple value, not on an model of voting protocol, bargaining or coalition formation. In particular the queue formation procedure of voting is merel a heuristic device for calculating the values of the SS. It is not intended as a justification of the Shaple-Shubik index, and is certainl not to be taken seriousl as a description of how voting actuall takes place.

31 Alternative bargaining model: A voter can vote either in favor or against the proposal submitted to vote. 1 n 2 n s s + 1 s + 2 n WINNING 1 n 2 n s n s + 1 s + 2 n LOSING

32 Some other indices of P-power indices the Banzhaf, normalized, index

33 Some other indices of P-power indices the Banzhaf, normalized, index Banzhaf index (I-power)

34 Some other indices of P-power indices the Banzhaf, normalized, index Banzhaf index (I-power) the Johnston index the Deegan-Packel index the Holler index the do not come from the cooperative context the nucleolus it comes from the cooperative context

35 Reasonable requirements for P-power Minimum requirements: E Efficienc N+ET Null and equal treatment properties S Sensitivit Weak sensitivit: if v(s {i}) v(s {j}) for all S N \ {i, j}, then ψ i (v) ψ j (v) Strong sensitivit: if, moreover, v(s {i}) > v(s {j}) for some S N \ {i, j}, then ψ i (v) > ψ j (v). Onl... SS, Bz, Jh fulfill them.

36 Some other reasonable requirements for P-power D Let u and w two simple games, and C i (u) C i (w), then ψ i (u) ψ i (w).

37 Some other reasonable requirements for P-power D Let u and w two simple games, and C i (u) C i (w), then ψ i (u) ψ i (w). [8; 5, 3, 1, 1, 1] and [8; 4, 4, 1, 1, 1] (donation) AV Let u and w be derived from u b adding a veto plaer i, then for all j, k N the power of the plaers in N should remain proportional ψ j (u)/ψ k (u) = ψ j (w)/ψ k (w)

38 Some other reasonable requirements for P-power D Let u and w two simple games, and C i (u) C i (w), then ψ i (u) ψ i (w). [8; 5, 3, 1, 1, 1] and [8; 4, 4, 1, 1, 1] (donation) AV Let u and w be derived from u b adding a veto plaer i, then for all j, k N the power of the plaers in N should remain proportional ψ j (u)/ψ k (u) = ψ j (w)/ψ k (w) No known index satisfies all these axioms: E+N+ET+S+D+AV (conjecture)

39 Some other reasonable requirements for P-power D Let u and w two simple games, and C i (u) C i (w), then ψ i (u) ψ i (w). [8; 5, 3, 1, 1, 1] and [8; 4, 4, 1, 1, 1] (donation) AV Let u and w be derived from u b adding a veto plaer i, then for all j, k N the power of the plaers in N should remain proportional ψ j (u)/ψ k (u) = ψ j (w)/ψ k (w) No known index satisfies all these axioms: E+N+ET+S+D+AV (conjecture) No index satisfies: E+N+ET+T+AV (trivial impossibilit theorem)

40 Measuring...decisiveness as influence The Banzhaf index is simpl the probabilit of being crucial in the game. Bz a [W ] = C a[w ] 2 n 1 = Probabilit for a of being crucial where C a [W ] = {S N : S W, S \ {a} / W }.

41 Measuring...decisiveness as influence The Banzhaf index is simpl the probabilit of being crucial in the game. Bz a [W ] = C a[w ] 2 n 1 = Probabilit for a of being crucial where C a [W ] = {S N : S W, S \ {a} / W }. Onl a winning coalition will be formed. All winning coalitions have equal probabilit of being formed. All crucial voters receive equal shares. Efficienc is not a requirement.

42 Consider the 1958 EU voting sstem: [12; 4, 4, 4, 2, 2, 1] [6; 2, 2, 2, 1, 1, 0]) C B [W ] = {3B, 3B + S, 2B + 2S} models that represent 1, 2 and 2 coalitions respectivel.

43 Consider the 1958 EU voting sstem: [12; 4, 4, 4, 2, 2, 1] [6; 2, 2, 2, 1, 1, 0]) C B [W ] = {3B, 3B + S, 2B + 2S} models that represent 1, 2 and 2 coalitions respectivel. C S [W ] = {2B + 2S} model that represents 3 coalitions. ( 5 Bz[W ] = 16, 5 16, 5 16, 3 16, 3 ) 16, 0

44 To emulate the SS index, some scholars provide axiomatizations for the Banzhaf (value) index. Owen (1978) Lehrer (1988) (Banzhaf value) Feltkamp (1995) Barua et al. (2005)

45 Measuring success, luckiness and inclusiveness Success: Rae i [W ] = S : i S W S : i / S / W 2 n + 2 n

46 Measuring success, luckiness and inclusiveness Success: Rae i [W ] = S : i S W 2 n + Luckiness: S : i / S / W 2 n Luc i [W ] = S : i S W, S \ i W S : i / S / W, S i / W 2 n + 2 n

47 Measuring success, luckiness and inclusiveness Success: Rae i [W ] = S : i S W 2 n + Luckiness: S : i / S / W 2 n Luc i [W ] = S : i S W, S \ i W S : i / S / W, S i / W 2 n + 2 n Inclusiveness: KB i [W ] = W i W where W i = {S W : i S}

48 W m = {{1, 2}, {1, 3}, {2, 3}} Rae 1 [W ] {1, 2}, {1, 3}, {1, 2, 3}, {2}, {3}, { } Luc 1 [W ] { }, {1, 2, 3} Observe... Rae 1 [W ] = 6 8 = 3 4, Luc 1[W ] = 2 8 = 1 4, Bz 1[W ] = 1 2

49 W m = {{1, 2}, {1, 3}, {2, 3}} Rae 1 [W ] {1, 2}, {1, 3}, {1, 2, 3}, {2}, {3}, { } Luc 1 [W ] { }, {1, 2, 3} Rae 1 [W ] = 6 8 = 3 4, Luc 1[W ] = 2 8 = 1 4, Bz 1[W ] = 1 2 Observe... but also Rae 1 [W ] = Bz 1 [W ] + Luc 1 [W ] Rae 1 [W ] = Bz 1[W ].

50 Barr s equation and Dube and Shaple s equation: Rae i [W ] = Bz i [W ] + Luc i [W ] for all i N Success = Decisiveness + Luckiness

51 Barr s equation and Dube and Shaple s equation: Rae i [W ] = Bz i [W ] + Luc i [W ] for all i N Success = Decisiveness + Luckiness Rae i [W ] = Bz i[w ] for all i N linear relationship between success and decisiveness

52 Probabilit distribution Barr s equation: Dube and Shaple s equation Model: ((N, W ), p)

53 Probabilit distribution Barr s equation: Dube and Shaple s equation Model: ((N, W ), p) Assume that a probabilit distribution over vote configurations p (exogenous information) enters as a second input besides the simple game W. Of course, 0 p(s) 1 for all S N, and S N p(s) = 1. In a voting situation thus described b the pair (W, p) the ease of passing proposals or probabilit of acceptance is given b α(w, p) = Prob (acceptance) = p(s) S:S W

54 Probabilit distribution Barr s equation: Dube and Shaple s equation Success and Decisiveness in the model ((N, W ), p)) Ω i (W, p) = Prob (i is successful) = Φ i (W, p) = Prob (i is decisive) = Λ i (W, p) = Prob (i is luck) = S:i S W S:i S W S\{i}/ W S:i S S\{i} W p(s) + p(s) + p(s) + S:i / S / W S:i / S / W S {i} W S:i / S S {i}/ W p(s). p(s). p(s)

55 Probabilit distribution Barr s equation: Dube and Shaple s equation Success and Decisiveness in the model ((N, W ), p)) Ω i (W, p) = Prob (i is successful) = Φ i (W, p) = Prob (i is decisive) = Λ i (W, p) = Prob (i is luck) = S:i S W S:i S W S\{i}/ W S:i S S\{i} W p(s) + p(s) + p(s) + S:i / S / W S:i / S / W S {i} W S:i / S S {i}/ W p(s). p(s). p(s) Barr s equation is still true: success = decisiveness + luckiness Ω i (W, p) = Φ i (W, p) + Λ i (W, p)

56 Probabilit distribution Barr s equation: Dube and Shaple s equation Dube and Shaple s equation: Ω i (W, p) Φ i(w, p) does not extend in the more general context ((N, W ), p) Onl for p = ( 1 2, 1 2,..., 1 ) the equalit 2 Ω i (W, p) = Φ i(w, p) holds. For p = (p,..., p) the two indices rank voters in the same wa, but For p (p,..., p) is is alwas possible to find W such that the rankings do not coincide.

57 Probabilit distribution Barr s equation: Dube and Shaple s equation To be or not to be? What is more important, to be decisive or to be successful?

58 Probabilit distribution Barr s equation: Dube and Shaple s equation Questions?

59 Probabilit distribution Barr s equation: Dube and Shaple s equation THANKS FOR YOUR ATTENTION

The Shapley value and power indices

The Shapley value and power indices Politecnico di Milano 1/16 Summary of the slides 1 The Shapley value 2 The axioms and the theorem 3 The Shapley value in simple games 4 Semivalues 5 The UN security council 2/16 Properties for a one point

More information

The nucleolus, the Shapley value and power indices

The nucleolus, the Shapley value and power indices Politecnico di Milano Excess A TU game v is given Definition The excess of a coalition A over the imputation x is e(a, x) = v(a) i A x i e(a, x) is a measure of the dissatisfaction of the coalition A with

More information

Power indices expressed in terms of minimal winning coalitions

Power indices expressed in terms of minimal winning coalitions Power indices expressed in terms of minimal winning coalitions Fabien Lange László Á. Kóczy Abstract A voting situation is given by a set of voters and the rules of legislation that determine minimal requirements

More information

The Shapley Value for games with a finite number of effort levels. by Joël Adam ( )

The Shapley Value for games with a finite number of effort levels. by Joël Adam ( ) The Shapley Value for games with a finite number of effort levels by Joël Adam (5653606) Department of Economics of the University of Ottawa in partial fulfillment of the requirements of the M.A. Degree

More information

arxiv: v1 [cs.gt] 14 Dec 2018

arxiv: v1 [cs.gt] 14 Dec 2018 WHICH CRITERIA QUALIFY POWER INDICES FOR APPLICATIONS? A COMMENT TO THE STORY OF THE POOR PUBLIC GOOD INDEX SASCHA KURZ ABSTRACT. We discuss possible criteria that may qualify or disqualify power indices

More information

The Potential of the Holler-Packel Value and Index: A New Characterization

The Potential of the Holler-Packel Value and Index: A New Characterization Homo Oeconomicus 24(2): 255 268 (2007) www.accedoverlag.de The Potential of the Holler-Packel Value and Index: A New Characterization Ruxandra Haradau Institute of SocioEconomics, University of Hamburg,

More information

MA Game Theory 2005, LSE

MA Game Theory 2005, LSE MA. Game Theor, LSE Problem Set The problems in our third and final homework will serve two purposes. First, the will give ou practice in studing games with incomplete information. Second (unless indicated

More information

SF2972 Game Theory Problem set on extensive form games

SF2972 Game Theory Problem set on extensive form games SF2972 Game Theor Problem set on etensive form games Mark Voorneveld There are five eercises, to be handed in at the final lecture (March 0). For a bonus point, please answer all questions; at least half

More information

Power Indices, Explaining Paradoxes Dealing With Power and Including Abstention

Power Indices, Explaining Paradoxes Dealing With Power and Including Abstention Power Indices, Explaining Paradoxes Dealing With Power and Including Abstention senior project of Stephanie Kuban Advisor: Dr. Adam Weyhaupt Southern Illinois University Edwardsville May 12, 2011 1 Introduction

More information

Two variations of the Public Good Index for games with a priori unions

Two variations of the Public Good Index for games with a priori unions Two variations of the Public Good Index for games with a priori unions J. M. Alonso-Meiide 1, B. Casas-Méndez 2, G. Fiestras-Janeiro 3, M. J. Holler 4 Abstract This paper discusses two variations of the

More information

February 11, JEL Classification: C72, D43, D44 Keywords: Discontinuous games, Bertrand game, Toehold, First- and Second- Price Auctions

February 11, JEL Classification: C72, D43, D44 Keywords: Discontinuous games, Bertrand game, Toehold, First- and Second- Price Auctions Eistence of Mied Strateg Equilibria in a Class of Discontinuous Games with Unbounded Strateg Sets. Gian Luigi Albano and Aleander Matros Department of Economics and ELSE Universit College London Februar

More information

Cooperative Games. M2 ISI Systèmes MultiAgents. Stéphane Airiau LAMSADE

Cooperative Games. M2 ISI Systèmes MultiAgents. Stéphane Airiau LAMSADE Cooperative Games M2 ISI 2015 2016 Systèmes MultiAgents Stéphane Airiau LAMSADE M2 ISI 2015 2016 Systèmes MultiAgents (Stéphane Airiau) Cooperative Games 1 Why study coalitional games? Cooperative games

More information

University of California, Los Angeles Department of Statistics. Joint probability distributions

University of California, Los Angeles Department of Statistics. Joint probability distributions Universit of California, Los Angeles Department of Statistics Statistics 100A Instructor: Nicolas Christou Joint probabilit distributions So far we have considered onl distributions with one random variable.

More information

Power in the US Legislature

Power in the US Legislature Power in the US Legislature Victoria Powers May 16, 2017 Abstract Using a standard model of the US legislative system as a monotonic simple game, we look at rankings of the four types of players the president,

More information

Bounds on Manipulation by Merging in Weighted Voting Games 1

Bounds on Manipulation by Merging in Weighted Voting Games 1 Bounds on Manipulation by Merging in Weighted Voting Games Ramoni O. Lasisi and Abibat A. Lasisi Abstract Manipulation by merging in weighted voting games (WVGs) is a voluntary action of would-be strategic

More information

Game Theory: Spring 2017

Game Theory: Spring 2017 Game Theory: Spring 2017 Ulle Endriss Institute for Logic, Language and Computation University of Amsterdam Ulle Endriss 1 Plan for Today Today we are going to review solution concepts for coalitional

More information

The Category of Simple Voting Games

The Category of Simple Voting Games The Category of Simple Voting Games Simon Terrington July 11th, 2004 In this paper I describe a notation for simple voting games that has three properties: It facilitates the calculation of the measures

More information

Representation-Compatible Power Indices

Representation-Compatible Power Indices Representation-Compatible Power Indices Serguei Kaniovski Sascha Kurz August, 07 Abstract This paper studies power indices based on average representations of a weighted game. If restricted to account

More information

José María Alonso-Meijide Mikel Álvarez-Mozos María Gloria Fiestras-Janeiro

José María Alonso-Meijide Mikel Álvarez-Mozos María Gloria Fiestras-Janeiro Col.lecció d Economia E15/328 Power Indices and Minimal Winning Coalitions in Simple Games with Externalities José María Alonso-Meijide Mikel Álvarez-Mozos María Gloria Fiestras-Janeiro UB Economics Working

More information

Approximating Power Indices

Approximating Power Indices Approximating Power Indices Yoram Bachrach School of Engineering and Computer Science Hebrew University Jerusalem, Israel yori@cs.huji.ac.il Jeffrey S. Rosenschein School of Engineering and Computer Science

More information

A note on the ordinal equivalence of power indices in games with coalition structure

A note on the ordinal equivalence of power indices in games with coalition structure A note on the ordinal equivalence of power indices in games with coalition structure Sébastien Courtin, Bertrand Tchantcho To cite this version: Sébastien Courtin, Bertrand Tchantcho. A note on the ordinal

More information

RELATIONS AND FUNCTIONS through

RELATIONS AND FUNCTIONS through RELATIONS AND FUNCTIONS 11.1.2 through 11.1. Relations and Functions establish a correspondence between the input values (usuall ) and the output values (usuall ) according to the particular relation or

More information

and the tension between weight and power

and the tension between weight and power and the tension between weight and power Annemieke Reijngoud & Ole Martin Brende Cooperative May 16, 2010 1 / 24 Outline Power Indices Background Analysis Fair Game Terminology Observations Running Time

More information

AXIOMATIC CHARACTERIZATIONS OF THE SYMMETRIC COALITIONAL BINOMIAL SEMIVALUES. January 17, 2005

AXIOMATIC CHARACTERIZATIONS OF THE SYMMETRIC COALITIONAL BINOMIAL SEMIVALUES. January 17, 2005 AXIOMATIC CHARACTERIZATIONS OF THE SYMMETRIC COALITIONAL BINOMIAL SEMIVALUES José María Alonso Meijide, Francesc Carreras and María Albina Puente January 17, 2005 Abstract The symmetric coalitional binomial

More information

On Influence and Power Indices

On Influence and Power Indices On Influence and Power Indices MICHEL GRABISCH 2 and AGNIESZKA RUSINOWSKA 34 Université Paris I Panthéon-Sorbonne LIP6, 8 rue du Capitaine Scott 7505 Paris, France Michel.Grabisch@lip6.fr 2 CERMSEM 06-2,

More information

SHAPLEY-SHUBIK AND BANZHAF INDICES REVISITED

SHAPLEY-SHUBIK AND BANZHAF INDICES REVISITED SHAPLEY-SHUBIK AND BANZHAF INDICES REVISITED Annick Laruelle and Federico Valenciano WP-AD 2000-02 Correspondence to A. Laruelle: Universidad de Alicante. Departamento de Fundamentos del An alisis Econ

More information

Math for Liberal Studies

Math for Liberal Studies Math for Liberal Studies We want to measure the influence each voter has As we have seen, the number of votes you have doesn t always reflect how much influence you have In order to measure the power of

More information

Economics Bulletin, 2012, Vol. 32 No. 1 pp Introduction. 2. The preliminaries

Economics Bulletin, 2012, Vol. 32 No. 1 pp Introduction. 2. The preliminaries 1. Introduction In this paper we reconsider the problem of axiomatizing scoring rules. Early results on this problem are due to Smith (1973) and Young (1975). They characterized social welfare and social

More information

Measuring influence in command games

Measuring influence in command games Measuring influence in command games Michel Grabisch, Agnieszka Rusinowska To cite this version: Michel Grabisch, Agnieszka Rusinowska. Measuring influence in command games. Working paper GATE 2008-02.

More information

Biprobabilistic values for bicooperative games

Biprobabilistic values for bicooperative games Discrete Applied Mathematics 156 (2008) 2698 2711 www.elsevier.com/locate/dam Biprobabilistic values for bicooperative games J.M. Bilbao, J.R. Fernández, N. Jiménez, J.J. López Escuela Superior de Ingenieros,

More information

Experimental Analysis of the Effects of Manipulations in Weighted Voting Games

Experimental Analysis of the Effects of Manipulations in Weighted Voting Games Utah State University DigitalCommons@USU All Graduate Theses and Dissertations Graduate Studies 8-2013 Experimental Analysis of the Effects of Manipulations in Weighted Voting Games Ramoni Olaoluwa Lasisi

More information

Monotonicity of Power in Weighted Voting Games with Restricted Communication

Monotonicity of Power in Weighted Voting Games with Restricted Communication Monotonicity of Power in Weighted Voting Games with Restricted Communication Stefan Napel University of Bayreuth & Public Choice Research Centre, Turku Andreas Nohn Public Choice Research Centre, Turku

More information

Monotonicity of Power in Weighted Voting Games with Restricted Communication

Monotonicity of Power in Weighted Voting Games with Restricted Communication Monotonicity of Power in Weighted Voting Games with Restricted Communication Stefan Napel University of Bayreuth & Public Choice Research Centre, Turku Andreas Nohn Public Choice Research Centre, Turku

More information

We start by computing the characteristic polynomial of A as. det (A λi) = det. = ( 2 λ)(1 λ) (2)(2) = (λ 2)(λ + 3)

We start by computing the characteristic polynomial of A as. det (A λi) = det. = ( 2 λ)(1 λ) (2)(2) = (λ 2)(λ + 3) Let A [ 2 2 2 Compute the eigenvalues and eigenspaces of A We start b computing the characteristic polnomial of A as [ 2 λ 2 det (A λi) det 2 λ ( 2 λ)( λ) (2)(2) λ 2 + λ 2 4 λ 2 + λ 6 (λ 2)(λ + 3) The

More information

Advanced Microeconomics

Advanced Microeconomics Advanced Microeconomics Cooperative game theory Harald Wiese University of Leipzig Harald Wiese (University of Leipzig) Advanced Microeconomics 1 / 45 Part D. Bargaining theory and Pareto optimality 1

More information

Centre d Economie de la Sorbonne UMR 8174

Centre d Economie de la Sorbonne UMR 8174 Centre d Economie de la Sorbonne UMR 8174 Axiomatisation of the Shapley value and power index for bi-cooperative games Christophe LABREUCHE Michel GRABISCH 2006.23 Maison des Sciences Économiques, 106-112

More information

An Information Theory For Preferences

An Information Theory For Preferences An Information Theor For Preferences Ali E. Abbas Department of Management Science and Engineering, Stanford Universit, Stanford, Ca, 94305 Abstract. Recent literature in the last Maimum Entrop workshop

More information

Math-Net.Ru All Russian mathematical portal

Math-Net.Ru All Russian mathematical portal Math-Net.Ru All Russian mathematical portal Osman Palanci, S. Zeynep Alparslan Gök, Gerhard-Wilhelm Weber, An axiomatization of the interval Shapley value and on some interval solution concepts, Contributions

More information

Characterization of the Banzhaf Value Using a Consistency Axiom

Characterization of the Banzhaf Value Using a Consistency Axiom CUBO A Mathematical Journal Vol.1, N ō 01, (1 6). March 010 Characterization of the Banzhaf Value Using a Consistency Axiom Joss Erick Sánchez Pérez Facultad de Economía, UASLP, Av. Pintores s/n, Col.

More information

International Journal of Pure and Applied Mathematics Volume 22 No , ON THE INVERSE PROBLEM FOR SEMIVALUES OF COOPERATIVE TU GAMES

International Journal of Pure and Applied Mathematics Volume 22 No , ON THE INVERSE PROBLEM FOR SEMIVALUES OF COOPERATIVE TU GAMES International Journal of Pure and Applied Mathematics Volume No. 4 005, 539-555 ON THE INVERSE PROBLEM FOR SEMIVALUES OF COOPERATIVE TU GAMES Irinel Dragan Department of Mathematics The University of Texas

More information

Unit 12 Study Notes 1 Systems of Equations

Unit 12 Study Notes 1 Systems of Equations You should learn to: Unit Stud Notes Sstems of Equations. Solve sstems of equations b substitution.. Solve sstems of equations b graphing (calculator). 3. Solve sstems of equations b elimination. 4. Solve

More information

On the not-preference-based Hoede-Bakker index

On the not-preference-based Hoede-Bakker index On the not-preference-based Hoede-Baer index Agniesza Rusinowsa To cite this version: Agniesza Rusinowsa. On the not-preference-based Hoede-Baer index. L. Petrosjan and V. Mazalov. Game Theory and Applications,

More information

6.207/14.15: Networks Lecture 24: Decisions in Groups

6.207/14.15: Networks Lecture 24: Decisions in Groups 6.207/14.15: Networks Lecture 24: Decisions in Groups Daron Acemoglu and Asu Ozdaglar MIT December 9, 2009 1 Introduction Outline Group and collective choices Arrow s Impossibility Theorem Gibbard-Satterthwaite

More information

Elections and Strategic Voting: Condorcet and Borda. P. Dasgupta E. Maskin

Elections and Strategic Voting: Condorcet and Borda. P. Dasgupta E. Maskin Elections and Strategic Voting: ondorcet and Borda P. Dasgupta E. Maskin voting rule (social choice function) method for choosing social alternative (candidate) on basis of voters preferences (rankings,

More information

Characterization of the Shapley-Shubik Power Index Without the E ciency Axiom

Characterization of the Shapley-Shubik Power Index Without the E ciency Axiom Characterization of the Shapley-Shubik Power Index Without the E ciency Axiom Ezra Einy y and Ori Haimanko z Abstract We show that the Shapley-Shubik power index on the domain of simple (voting) games

More information

or just I if the set A is clear. Hence we have for all x in A the identity function I ( )

or just I if the set A is clear. Hence we have for all x in A the identity function I ( ) 3 Functions 46 SECTON E Properties of Composite Functions the end of this section ou will be able to understand what is meant b the identit function prove properties of inverse function prove properties

More information

Hierarchy of players in swap robust voting games

Hierarchy of players in swap robust voting games Economics Working Papers (2002 2016) Economics 10-22-2009 Hierarchy of players in swap robust voting games Monisankar Bishnu Iowa State University, mbishnu@iastate.edu Sonali Roy Iowa State University,

More information

A generalization of Condorcet s Jury Theorem to weighted voting games with many small voters

A generalization of Condorcet s Jury Theorem to weighted voting games with many small voters Economic Theory (2008) 35: 607 611 DOI 10.1007/s00199-007-0239-2 EXPOSITA NOTE Ines Lindner A generalization of Condorcet s Jury Theorem to weighted voting games with many small voters Received: 30 June

More information

2.5 Potential blocs, quarreling paradoxes and bandwagon effects

2.5 Potential blocs, quarreling paradoxes and bandwagon effects Mathematical Models in Economics and Finance Topic 2 Analysis of powers in voting systems 2.1 Weighted voting systems and yes-no voting systems 2.2 Power indexes: Shapley-Shubik index and Banzhaf index

More information

Decision tables and decision spaces

Decision tables and decision spaces Abstract Decision tables and decision spaces Z. Pawlak 1 Abstract. In this paper an Euclidean space, called a decision space is associated with ever decision table. This can be viewed as a generalization

More information

Ziv Hellman and Ron Peretz Graph value for cooperative games

Ziv Hellman and Ron Peretz Graph value for cooperative games Ziv Hellman and Ron Peretz Graph value for cooperative games Working paper Original citation: Hellman, Ziv and Peretz, Ron (2013) Graph value for cooperative games. Department of Mathematics, London School

More information

Week 3 September 5-7.

Week 3 September 5-7. MA322 Weekl topics and quiz preparations Week 3 September 5-7. Topics These are alread partl covered in lectures. We collect the details for convenience.. Solutions of homogeneous equations AX =. 2. Using

More information

The Shapley value on convex geometries

The Shapley value on convex geometries Discrete Applied Mathematics 103 (2000) 33 40 The Shapley value on convex geometries J.M. Bilbao a;, P.H. Edelman b a Escuela Superior Ingenieros, Matematica Applicada II, Universidad de Sevilla, Camino

More information

Subjective multi-prior probability: a representation of a partial l

Subjective multi-prior probability: a representation of a partial l Subjective multi-prior probability: a representation of a partial likelihood relation TAU, 22-11-2011 Outline of the talk: Motivation Background Examples Axioms Result Related literature Outline of the

More information

Reliability analysis of systems and lattice polynomial description

Reliability analysis of systems and lattice polynomial description Reliability analysis of systems and lattice polynomial description Jean-Luc Marichal University of Luxembourg Luxembourg A basic reference Selected references R. E. Barlow and F. Proschan. Statistical

More information

Proof Systems and Transformation Games

Proof Systems and Transformation Games Proof Systems and Transformation Games Yoram Bachrach Michael Zuckerman Michael Wooldridge Jeffrey S. Rosenschein Microsoft Research, Cambridge, UK Hebrew University, Jerusalem, Israel University of Oxford,

More information

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India November 2007

Game Theory. Lecture Notes By Y. Narahari. Department of Computer Science and Automation Indian Institute of Science Bangalore, India November 2007 Game Theory Lecture Notes By Y. Narahari Department of Computer Science and Automation Indian Institute of Science Bangalore, India November 2007 COOPERATIVE GAME THEORY 6. Other Solution Concepts Note:

More information

Methods for Advanced Mathematics (C3) Coursework Numerical Methods

Methods for Advanced Mathematics (C3) Coursework Numerical Methods Woodhouse College 0 Page Introduction... 3 Terminolog... 3 Activit... 4 Wh use numerical methods?... Change of sign... Activit... 6 Interval Bisection... 7 Decimal Search... 8 Coursework Requirements on

More information

QUESTION ONE Let 7C = Total Cost MC = Marginal Cost AC = Average Cost

QUESTION ONE Let 7C = Total Cost MC = Marginal Cost AC = Average Cost ANSWER QUESTION ONE Let 7C = Total Cost MC = Marginal Cost AC = Average Cost Q = Number of units AC = 7C MC = Q d7c d7c 7C Q Derivation of average cost with respect to quantity is different from marginal

More information

Amalgamating players, symmetry and the Banzhaf value

Amalgamating players, symmetry and the Banzhaf value Working Papers Institute of Mathematical Economics 44 December 010 Amalgamating players, symmetry and the Banzhaf value André Casajus IMW Bielefeld University Postfach 100131 33501 Bielefeld Germany email:

More information

9. The Monopsonist. π = c x [g s + s Gs] (9.1) subject to. Ax s (9.2) x 0, s 0. The economic interpretation of this model proceeds as in previous

9. The Monopsonist. π = c x [g s + s Gs] (9.1) subject to. Ax s (9.2) x 0, s 0. The economic interpretation of this model proceeds as in previous 9. The Monopsonist An economic agent who is the sole buer of all the available suppl of an input is called a monopsonist. We will discusss two categories of monopsonists: the pure monopsonist and the perfectl

More information

Incentives to form the grand coalition versus no incentive to split off from the grand coalition

Incentives to form the grand coalition versus no incentive to split off from the grand coalition Incentives to form the grand coalition versus no incentive to split off from the grand coalition Katsushige FUJIMOTO College of Symbiotic Systems Science, Fukushima University, 1 Kanayagawa Fukushima,

More information

Best reply dynamics for scoring rules

Best reply dynamics for scoring rules Best reply dynamics for scoring rules R. Reyhani M.C Wilson Department of Computer Science University of Auckland 3rd Summer workshop of CMSS, 20-22 Feb 2012 Introduction Voting game Player (voter) action

More information

STAT:5100 (22S:193) Statistical Inference I

STAT:5100 (22S:193) Statistical Inference I STAT:5100 (22S:193) Statistical Inference I Week 3 Luke Tierney University of Iowa Fall 2015 Luke Tierney (U Iowa) STAT:5100 (22S:193) Statistical Inference I Fall 2015 1 Recap Matching problem Generalized

More information

Monotonicity of power in games with a priori unions

Monotonicity of power in games with a priori unions Monotonicity of power in games with a priori unions J.M Alonso-Meijide 1, C. Bowles 2, M. J. Holler 3, S. Napel 4 February 29, 2008 Abstract Power indices are commonly required to assign at least as much

More information

13 Social choice B = 2 X X. is the collection of all binary relations on X. R = { X X : is complete and transitive}

13 Social choice B = 2 X X. is the collection of all binary relations on X. R = { X X : is complete and transitive} 13 Social choice So far, all of our models involved a single decision maker. An important, perhaps the important, question for economics is whether the desires and wants of various agents can be rationally

More information

Section 2: Wave Functions and Probability Solutions

Section 2: Wave Functions and Probability Solutions Phsics 43a: Quantum Mechanics I Section : Wave Functions and Probabilit Solutions Spring 5, Harvard Here is a summar of the most important points from the second week with a few of m own tidbits), relevant

More information

The Cost of Principles: Analyzing Power in Compatibility Weighted Voting Games

The Cost of Principles: Analyzing Power in Compatibility Weighted Voting Games The Cost of Principles: Analyzing Power in Compatibility Weighted Voting Games Abigail See University of Cambridge aes65@cam.ac.uk Yoram Bachrach Microsoft Research yobach@microsoft.com Pushmeet Kohli

More information

14.1 Systems of Linear Equations in Two Variables

14.1 Systems of Linear Equations in Two Variables 86 Chapter 1 Sstems of Equations and Matrices 1.1 Sstems of Linear Equations in Two Variables Use the method of substitution to solve sstems of equations in two variables. Use the method of elimination

More information

3.0 PROBABILITY, RANDOM VARIABLES AND RANDOM PROCESSES

3.0 PROBABILITY, RANDOM VARIABLES AND RANDOM PROCESSES 3.0 PROBABILITY, RANDOM VARIABLES AND RANDOM PROCESSES 3.1 Introduction In this chapter we will review the concepts of probabilit, rom variables rom processes. We begin b reviewing some of the definitions

More information

USING GENERATING FUNCTIONS TO COMPUTE POWER INDICES. Advisor: Dr. Adam G. Weyhaupt. Southern Illinois University Edwardsville.

USING GENERATING FUNCTIONS TO COMPUTE POWER INDICES. Advisor: Dr. Adam G. Weyhaupt. Southern Illinois University Edwardsville. USING GENERATING FUNCTIONS TO COMPUTE POWER INDICES BRIAN J. HEGER Advisor: Dr. Adam G. Weyhaupt Southern Illinois University Edwardsville April 30, 2013 1. Introduction There is no doubt that California

More information

Editor-in-Chief of AGH University of Science and Technology Press Jan Sas

Editor-in-Chief of AGH University of Science and Technology Press Jan Sas Editor-in-Chief of AGH University of Science and Technology Press Jan Sas Editorial Board Editor-in-Chief Tadeusz Sawik Managing Editor Waldemar Kaczmarczyk Technical Editor Marek Karkula Members Jan Tadeusz

More information

Applied Cooperative Game Theory

Applied Cooperative Game Theory Applied Cooperative Game Theory André Casajus and Martin Kohl University of Leipzig December 2013 1 / 20 : An example consider a gloves game with two left-glove holders and four right-glove holders N =

More information

Seminar: Topics in Cooperative Game Theory

Seminar: Topics in Cooperative Game Theory Seminar: Topics in Cooperative Game Theory PD Dr. André Casajus LSI Leipziger Spieltheoretisches Institut November 18 2011 General remarks Write a well-structured essay: introduction/motivation, main part

More information

Multiagent Systems Motivation. Multiagent Systems Terminology Basics Shapley value Representation. 10.

Multiagent Systems Motivation. Multiagent Systems Terminology Basics Shapley value Representation. 10. Multiagent Systems July 2, 2014 10. Coalition Formation Multiagent Systems 10. Coalition Formation B. Nebel, C. Becker-Asano, S. Wöl Albert-Ludwigs-Universität Freiburg July 2, 2014 10.1 Motivation 10.2

More information

6.896 Topics in Algorithmic Game Theory February 8, Lecture 2

6.896 Topics in Algorithmic Game Theory February 8, Lecture 2 6.896 Topics in Algorithmic Game Theor Februar 8, 2010 Lecture 2 Lecturer: Constantinos Daskalakis Scribe: Yang Cai, Debmala Panigrahi In this lecture, we focus on two-plaer zero-sum games. Our goal is

More information

x. 4. 2x 10 4x. 10 x

x. 4. 2x 10 4x. 10 x CCGPS UNIT Semester 1 COORDINATE ALGEBRA Page 1 of Reasoning with Equations and Quantities Name: Date: Understand solving equations as a process of reasoning and eplain the reasoning MCC9-1.A.REI.1 Eplain

More information

Approximating power indices: theoretical and empirical analysis

Approximating power indices: theoretical and empirical analysis Auton Agent Multi-Agent Syst (2010) 20:105 122 DOI 10.1007/s10458-009-9078-9 Approximating power indices: theoretical and empirical analysis Yoram Bachrach Evangelos Markakis Ezra Resnick Ariel D. Procaccia

More information

Multiple Equilibria in the Citizen-Candidate Model of Representative Democracy.

Multiple Equilibria in the Citizen-Candidate Model of Representative Democracy. Multiple Equilibria in the Citizen-Candidate Model of Representative Democracy. Amrita Dhillon and Ben Lockwood This version: March 2001 Abstract De Sinopoli and Turrini (1999) present an example to show

More information

DUMMY PLAYERS AND THE QUOTA IN WEIGHTED VOTING GAMES

DUMMY PLAYERS AND THE QUOTA IN WEIGHTED VOTING GAMES DUMMY PLAYERS AND THE QUOTA IN WEIGHTED VOTING GAMES Fabrice BARTHELEMY, Dominique LEPELLEY and Mathieu MARTIN Abstract. This paper studies the role of the quota on the occurrence of dummy players in weighted

More information

The core of voting games: a partition approach

The core of voting games: a partition approach The core of voting games: a partition approach Aymeric Lardon To cite this version: Aymeric Lardon. The core of voting games: a partition approach. International Game Theory Review, World Scientific Publishing,

More information

MAT 1275: Introduction to Mathematical Analysis. Graphs and Simplest Equations for Basic Trigonometric Functions. y=sin( x) Function

MAT 1275: Introduction to Mathematical Analysis. Graphs and Simplest Equations for Basic Trigonometric Functions. y=sin( x) Function MAT 275: Introduction to Mathematical Analsis Dr. A. Rozenblum Graphs and Simplest Equations for Basic Trigonometric Functions We consider here three basic functions: sine, cosine and tangent. For them,

More information

10.5 Graphs of the Trigonometric Functions

10.5 Graphs of the Trigonometric Functions 790 Foundations of Trigonometr 0.5 Graphs of the Trigonometric Functions In this section, we return to our discussion of the circular (trigonometric functions as functions of real numbers and pick up where

More information

Lecture 1.1: The Minimax Theorem

Lecture 1.1: The Minimax Theorem Algorithmic Game Theor, Compleit and Learning Jul 17, 2017 Lecture 1.1: The Mini Theorem Lecturer: Constantinos Daskalakis Scribe: Constantinos Daskalakis In these notes, we show that a Nash equilibrium

More information

Representation of Functions by Power Series. Geometric Power Series

Representation of Functions by Power Series. Geometric Power Series 60_0909.qd //0 :09 PM Page 669 SECTION 9.9 Representation of Functions b Power Series 669 The Granger Collection Section 9.9 JOSEPH FOURIER (768 80) Some of the earl work in representing functions b power

More information

Consistency, anonymity, and the core on the domain of convex games

Consistency, anonymity, and the core on the domain of convex games Consistency, anonymity, and the core on the domain of convex games Toru Hokari Yukihiko Funaki April 25, 2014 Abstract Peleg (1986) and Tadenuma (1992) provide two well-known axiomatic characterizations

More information

Mathematical Notation Math Introduction to Applied Statistics

Mathematical Notation Math Introduction to Applied Statistics Mathematical Notation Math 113 - Introduction to Applied Statistics Name : Use Word or WordPerfect to recreate the following documents. Each article is worth 10 points and can be printed and given to the

More information

ENCOURAGING THE GRAND COALITION IN CONVEX COOPERATIVE GAMES

ENCOURAGING THE GRAND COALITION IN CONVEX COOPERATIVE GAMES STUDIA UNIV. BABEŞ BOLYAI, MATHEMATICA, Volume LIV, Number 1, March 2009 ENCOURAGING THE GRAND COALITION IN CONVEX COOPERATIVE GAMES TITU ANDREESCU AND ZORAN ŠUNIĆ Abstract. A solution function for convex

More information

Dual Bargaining and the Talmud Bankruptcy Problem

Dual Bargaining and the Talmud Bankruptcy Problem Dual Bargaining and the Talmud Bankruptcy Problem By Jingang Zhao * Revised January 2000 Department of Economics Ohio State University 1945 North High Street Columbus, OH 43210 1172 USA Zhao.18@Osu.Edu

More information

A MAXIMAL DOMAIN FOR STRATEGY-PROOF AND NO-VETOER RULES IN THE MULTI-OBJECT CHOICE MODEL

A MAXIMAL DOMAIN FOR STRATEGY-PROOF AND NO-VETOER RULES IN THE MULTI-OBJECT CHOICE MODEL Discussion Paper No. 809 A MAXIMAL DOMAIN FOR STRATEGY-PROOF AND NO-VETOER RULES IN THE MULTI-OBJECT CHOICE MODEL Kantaro Hatsumi Dolors Berga Shigehiro Serizawa April 2011 The Institute of Social and

More information

Political Economy of Institutions and Development. Lectures 2 and 3: Static Voting Models

Political Economy of Institutions and Development. Lectures 2 and 3: Static Voting Models 14.773 Political Economy of Institutions and Development. Lectures 2 and 3: Static Voting Models Daron Acemoglu MIT February 7 and 12, 2013. Daron Acemoglu (MIT) Political Economy Lectures 2 and 3 February

More information

Heuristic and exact solutions to the inverse power index problem for small voting bodies

Heuristic and exact solutions to the inverse power index problem for small voting bodies Heuristic and exact solutions to the inverse power index problem for small voting bodies Sascha Kurz and Stefan Napel University of Bayreuth, 95440 Bayreuth, Germany {sascha.kurz,stefan.napel}@uni-bayreuth.de

More information

LESSON #42 - INVERSES OF FUNCTIONS AND FUNCTION NOTATION PART 2 COMMON CORE ALGEBRA II

LESSON #42 - INVERSES OF FUNCTIONS AND FUNCTION NOTATION PART 2 COMMON CORE ALGEBRA II LESSON #4 - INVERSES OF FUNCTIONS AND FUNCTION NOTATION PART COMMON CORE ALGEBRA II You will recall from unit 1 that in order to find the inverse of a function, ou must switch and and solve for. Also,

More information

Eigenvectors and Eigenvalues 1

Eigenvectors and Eigenvalues 1 Ma 2015 page 1 Eigenvectors and Eigenvalues 1 In this handout, we will eplore eigenvectors and eigenvalues. We will begin with an eploration, then provide some direct eplanation and worked eamples, and

More information

Applied cooperative game theory:

Applied cooperative game theory: Applied cooperative game theory: The gloves game Harald Wiese University of Leipzig April 2010 Harald Wiese (Chair of Microeconomics) Applied cooperative game theory: April 2010 1 / 29 Overview part B:

More information

On tolerant or intolerant character of interacting criteria in aggregation by the Choquet integral

On tolerant or intolerant character of interacting criteria in aggregation by the Choquet integral On tolerant or intolerant character of interacting criteria in aggregation by the Choquet integral Jean-Luc Marichal Department of Mathematics, Brigham Young University 292 TMCB, Provo, Utah 84602, U.S.A.

More information

Axiomatization of an importance index for Generalized Additive Independence models

Axiomatization of an importance index for Generalized Additive Independence models Axiomatization of an importance index for Generalized Additive Independence models Mustapha Ridaoui 1, Michel Grabisch 1, Christophe Labreuche 2 1 Université Paris I - Panthéon-Sorbonne, Paris, France

More information

GATE Groupe d Analyse et de Théorie Économique DOCUMENTS DE TRAVAIL - WORKING PAPERS W.P A Relation-algebraic Approach to Simple Games

GATE Groupe d Analyse et de Théorie Économique DOCUMENTS DE TRAVAIL - WORKING PAPERS W.P A Relation-algebraic Approach to Simple Games GATE Groupe d Analyse et de Théorie Économique UMR 5824 du CNRS DOCUMENTS DE TRAVAIL - WORKING PAPERS W.P. 09-13 A Relation-algebraic Approach to Simple Games Rudolf Berghammer, Agnieszka Rusinowska, Harrie

More information

8.1 Exponents and Roots

8.1 Exponents and Roots Section 8. Eponents and Roots 75 8. Eponents and Roots Before defining the net famil of functions, the eponential functions, we will need to discuss eponent notation in detail. As we shall see, eponents

More information

Linear programming: Theory

Linear programming: Theory Division of the Humanities and Social Sciences Ec 181 KC Border Convex Analsis and Economic Theor Winter 2018 Topic 28: Linear programming: Theor 28.1 The saddlepoint theorem for linear programming The

More information