Filter by
Found 4 from your keywords: author="Vijay V. Vazirani"
Algorithmic Game Theory
We consider some classical games and show how they can arise in the context of the internet. We also introduce some of the basic solution concepts of game theory for studying such games, and some computational issues that arise for these concepts.
- Edition
- -
- ISBN/ISSN
- 987-0-521-87282-9
- Collation
- 1-775
- Series Title
- -
- Call Number
- -
Approximation Algorithms
- Edition
- -
- ISBN/ISSN
- -
- Collation
- -
- Series Title
- Approximation Algorithms
- Call Number
- -
- Edition
- -
- ISBN/ISSN
- -
- Collation
- -
- Series Title
- Approximation Algorithms
- Call Number
- -
Approximation Algorithms
NP-hard optimization problems exhibit a rich set of possibilities, all the way from allowing approximability to any required degree, to essentially not allowing approximability at all. Despite this diversity, underlying the process of design of approximation algorithms are some common principles. We will explore these in the current chapter. An optimization problem is polynomial time solvable …
- Edition
- 1st Edtion
- ISBN/ISSN
- -
- Collation
- 1-396
- Series Title
- Approximation Algorithms
- Call Number
- -
College of Computing Georgia Institute of Technology
- Edition
- -
- ISBN/ISSN
- -
- Collation
- -
- Series Title
- -
- Call Number
- -
- Edition
- -
- ISBN/ISSN
- -
- Collation
- -
- Series Title
- -
- Call Number
- -
Computer Science, Information & General Works 
Philosophy & Psychology 
Religion 
Social Sciences 
Language 
Pure Science 
Applied Sciences 
Art & Recreation 
Literature 
History & Geography