Librería:
Grand Eagle Retail, Mason, OH, Estados Unidos de America
Calificación del vendedor: 5 de 5 estrellas
Vendedor de AbeBooks desde 12 de octubre de 2005
Paperback. This monograph provides a comprehensive survey of Integer Programming Games (IPGs), focusing on both simultaneous games and bilevel programs. These games are characterized by the integral constraints with their strategy sets.The monograph starts with the fundamental definitions of these games and various solution concepts associated with them, and then derives the properties of the games and the solution concepts. For each of the two types of games simultaneous and bilevel one section is dedicated to the analysis of the games and another section is dedicated to the development and analyses of algorithms to solve them. The analyses sections present results on the computational complexity of the general as well as various restricted versions of the game. These sections also discuss the structural properties of the games and the equilibrium concepts associated with them. The algorithm sections, in contrast, present some of the state-of-the-art algorithms developed to solve these games, either exactly, approximately or fast under fixed-parameter assumptions. These sections also contain proofs of the correctness of these algorithms and an assessment of their theoretical run times in the worst-case scenario. This monograph provides a comprehensive survey of Integer Programming Games (IPGs), focusing on both simultaneous games and bilevel programs. These games are characterized by the integral constraints with their strategy sets. Shipping may be from multiple locations in the US or from the UK, depending on stock availability. N° de ref. del artículo 9781638285168
This monograph provides a comprehensive survey of Integer Programming Games (IPGs), focusing on both simultaneous games and bilevel programs. These games are characterized by the integral constraints with their strategy sets.
The monograph starts with the fundamental definitions of these games and various solution concepts associated with them, and then derives the properties of the games and the solution concepts. For each of the two types of games - simultaneous and bilevel - one section is dedicated to the analysis of the games and another section is dedicated to the development and analyses of algorithms to solve them. The analyses sections present results on the computational complexity of the general as well as various restricted versions of the game. These sections also discuss the structural properties of the games and the equilibrium concepts associated with them. The algorithm sections, in contrast, present some of the state-of-the-art algorithms developed to solve these games, either exactly, approximately or fast under fixed-parameter assumptions. These sections also contain proofs of the correctness of these algorithms and an assessment of their theoretical run times in the worst-case scenario.
Título: Integer Programming Games (Paperback)
Editorial: now publishers Inc, Hanover
Año de publicación: 2025
Encuadernación: Paperback
Condición: new
Librería: Ria Christie Collections, Uxbridge, Reino Unido
Condición: New. In. Nº de ref. del artículo: ria9781638285168_new
Cantidad disponible: Más de 20 disponibles
Librería: AHA-BUCH GmbH, Einbeck, Alemania
Taschenbuch. Condición: Neu. nach der Bestellung gedruckt Neuware - Printed after ordering - This monograph provides a comprehensive survey of Integer Programming Games (IPGs), focusing on both simultaneous games and bilevel programs. These games are characterized by the integral constraints with their strategy sets.The monograph starts with the fundamental definitions of these games and various solution concepts associated with them, and then derives the properties of the games and the solution concepts. For each of the two types of games - simultaneous and bilevel - one section is dedicated to the analysis of the games and another section is dedicated to the development and analyses of algorithms to solve them. The analyses sections present results on the computational complexity of the general as well as various restricted versions of the game. These sections also discuss the structural properties of the games and the equilibrium concepts associated with them. The algorithm sections, in contrast, present some of the state-of-the-art algorithms developed to solve these games, either exactly, approximately or fast under fixed-parameter assumptions. These sections also contain proofs of the correctness of these algorithms and an assessment of their theoretical run times in the worst-case scenario. Nº de ref. del artículo: 9781638285168
Cantidad disponible: 1 disponibles
Librería: Books Puddle, New York, NY, Estados Unidos de America
Condición: New. Nº de ref. del artículo: 26403795722
Cantidad disponible: 4 disponibles
Librería: Majestic Books, Hounslow, Reino Unido
Condición: New. Print on Demand. Nº de ref. del artículo: 409391317
Cantidad disponible: 4 disponibles
Librería: Biblios, Frankfurt am main, HESSE, Alemania
Condición: New. PRINT ON DEMAND. Nº de ref. del artículo: 18403795712
Cantidad disponible: 4 disponibles