Cookies?
Library Header Image
LSE Research Online LSE Library Services

Games, geometry, and the computational complexity of finding equilibria

von Stengel, Bernhard ORCID: 0000-0002-3488-8322 (2007) Games, geometry, and the computational complexity of finding equilibria. In: Proceedings of the 11th Conference on Theoretical Aspects of Rationality and Knowledge - Tark '07. ACM Press, New York, USA, pp. 4-5.

Full text not available from this repository.

Identification Number: 10.1145/1324249.1324253

Abstract

Game-theoretic problems have found massive recent interest in computer science. Obvious applications arise from the internet and electronic commerce, for example the study of online auctions.

Item Type: Book Section
Additional Information: © 2007 ACM
Divisions: Mathematics
Subjects: Q Science > QA Mathematics
Sets: Departments > Mathematics
Date Deposited: 10 Jun 2013 10:18
Last Modified: 06 Mar 2020 20:03
URI: http://eprints.lse.ac.uk/id/eprint/50717

Actions (login required)

View Item View Item