000 02271nam a22003615i 4500
001 279434
003 MX-SnUAN
005 20160429153945.0
007 cr nn 008mamaa
008 150903s2009 xxu| o |||| 0|eng d
020 _a9780387779287
_99780387779287
024 7 _a10.1007/9780387779287
_2doi
035 _avtls000332880
039 9 _a201509030210
_bVLOAD
_c201404122302
_dVLOAD
_c201404092032
_dVLOAD
_y201402041057
_zstaff
040 _aMX-SnUAN
_bspa
_cMX-SnUAN
_erda
100 1 _aSchwarze, Silvia.
_eautor
_9303753
245 1 0 _aPath Player Games :
_bAnalysis and Applications /
_cby Silvia Schwarze.
264 1 _aBoston, MA :
_bSpringer US,
_c2009.
300 _brecurso en línea.
336 _atexto
_btxt
_2rdacontent
337 _acomputadora
_bc
_2rdamedia
338 _arecurso en línea
_bcr
_2rdacarrier
347 _aarchivo de texto
_bPDF
_2rda
490 0 _aSpringer Optimization and Its Applications,
_x1931-6828 ;
_v24
500 _aSpringer eBooks
505 0 _aThe path player Game -- Games on Polyhedra A Generalization -- The Line Planning Game: An Application -- Summary.
520 _aA path player game is a new innovative type of game which considers network flow problems from the viewpoint of network owners. This strategy enables modeling real-world problems and has many practical applications. Key features: * Presents a rigorous exposition of the theoretical foundations of the concept of a path player game; * Suggests 18 practical open problems for future research in such areas as traffic planning, computation of equilibria, and optimization; * Examines potentials for games on polyhedra as well as integer versions of generalized Nash equilibria. Written clearly, with well-presented mathematics, this book is intended for graduate students, mathematicians, engineers, and computer scientists.
590 _aPara consulta fuera de la UANL se requiere clave de acceso remoto.
710 2 _aSpringerLink (Servicio en línea)
_9299170
776 0 8 _iEdición impresa:
_z9780387779270
856 4 0 _uhttp://remoto.dgb.uanl.mx/login?url=http://dx.doi.org/10.1007/978-0-387-77928-7
_zConectar a Springer E-Books (Para consulta externa se requiere previa autentificación en Biblioteca Digital UANL)
942 _c14
999 _c279434
_d279434