Leadership games with convex strategy sets

First Page		Document Content
Date: 2010-06-13 03:55:38 Game theory Gaming Decision theory Mathematics Bimatrix game Nash equilibrium Best response Zero-sum game Extensive-form game Normal-form game Stackelberg competition Minimax		Leadership games with convex strategy sets Add to Reading List Source URL: www.maths.lse.ac.uk Download Document from Source Website File Size: 264,04 KB Share Document on Facebook

	Solving a Location Problem of a Stackelberg Firm Competing with Cournot-Nash Firms Paul G. Berglund∗ Changhyun Kwon† DocID: 1rhOm - View Document
	The Price of Optimum in Stackelberg Games on Arbitrary Single Commodity Networks and Latency Functions A.C. Kaporis∗ Department of Computer Engineering and Informatics, University of Patras University Campus, Building DocID: 1qTEc - View Document
	The Price of Optimum in Stackelberg Games on Arbitrary Single Commodity Networks and Latency Functions A.C. Kaporis ∗ DocID: 1qFpQ - View Document
	Algorithms for the Price of Optimum in Stackelberg Games (2006; Kaporis, Spirakis) Alexis C. Kaporis, Department of Computer Engineering and Informatics, University of Patras http://students.ceid.upatras.gr/˜kaporis Pau DocID: 1qth4 - View Document
	Interactively Solving Repeated Games: A Toolbox Version 0.2 Sebastian Kranz* March 27, 2012 DocID: 1qrtI - View Document