Información del autor
Autor Deng, Xiaotie |
Documentos disponibles escritos por este autor (2)
Crear una solicitud de compra Refinar búsqueda
TÃtulo : Algorithmic Game Theory : 11th International Symposium, SAGT 2018, Beijing, China, September 11-14, 2018, Proceedings Tipo de documento: documento electrónico Autores: Deng, Xiaotie, Mención de edición: 1 ed. Editorial: [s.l.] : Springer Fecha de publicación: 2018 Número de páginas: XX, 276 p. 29 ilustraciones ISBN/ISSN/DL: 978-3-319-99660-8 Nota general: Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. Idioma : Inglés (eng) Palabras clave: Simulación por ordenador Red de computadoras Comercio electrónico TeorÃa de la codificación TeorÃa de la información Informática Matemáticas discretas Modelado por computadora Redes de comunicación informática comercio electrónico y negocios electrónicos TeorÃa de la codificación y la información Matemáticas discretas en informática Clasificación: 003.3 Resumen: Este libro constituye las actas arbitradas del 11.º Simposio Internacional sobre TeorÃa AlgorÃtmica de Juegos, SAGT 2018, celebrado en Beijing, China, en septiembre de 2018. Los 19 artÃculos completos presentados junto con 6 artÃculos breves y 5 charlas plenarias fueron cuidadosamente revisados ​​y seleccionados entre 54 presentaciones. Los artÃculos cubren varios aspectos importantes de la teorÃa algorÃtmica de juegos, incluido el equilibrio del mercado, subastas y aplicaciones, mercados bilaterales, corte de pasteles, juegos cooperativos, juegos de votación, programación de múltiples agentes, precio de estabilidad, diversos problemas de diseño de mecanismos: dinámica en lÃnea y múltiples etapas, asà como maximización de ingresos y asignación de recursos y aplicaciones. Nota de contenido: On Revenue Monotonicity in Combinatorial Auctions -- An Update on the Price of Stability -- Correlation-Robust Mechanism Design -- Job Security, Stability and Production Efficiency, with Applications to Auctions -- A Near Optimal Mechanism for Energy Aware Scheduling -- Information Elicitation for Bayesian Auctions -- The Complexity of Cake Cutting with Unequal Shares -- Resource Based Cooperative Games: Optimization, Fairness and Stability -- Coreness of Cooperative Games with Truncated Submodular Profit Functions -- Strategic Contention Resolution in Multiple Channelswith Limited Feedback -- Simple Games Versus Weighted Voting Games -- Hide and Seek Game with Multiple Resources -- An Improved Envy-Free Cake Cutting Protocol for Four Agents -- A Truthful Mechanism for Interval Scheduling -- On Revenue-Maximizing Mechanisms Assuming Convex Costs -- The Communication Burden of Single Transferable Vote, in Practice -- On the Price of Stability of Social Distance Games -- Schelling Segregation withStrategic Agents -- Efficient Rational Proofs with Strong Utility-Gap Guarantees -- Removal and Threshold Pricing: Truthful Two-sided Markets with Multi-dimensional Participants -- A Two-Stage Mechanism for Ordinal Peer Assessment -- Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance -- The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty -- Online Trading as a Secretary Problem -- Constrained Swap Dynamics over a Social Network in Distributed Resource Reallocation -- A Hashing Power Allocation Game in Cryptocurrencies among Risk Neutral Miners -- What is the Optimal Deferral Number in Waitlist Mechanism -- An Optimal Strategy for Static Black-Peg Mastermind With Three Pegs -- Tight Bounds on the Relative Performances of Pricing Mechanisms in Storable Good Markets. Tipo de medio : Computadora Summary : This book constitutes the refereed proceedings of the 11th International Symposium on Algorithmic Game Theory, SAGT 2018, held in Beijing, China, in September 2018. The 19 full papers presented together with 6 short papers and 5 plenary talks were carefully reviewed and selected from 54 submissions. The papers cover various important aspects of algorithmic game theory including market equilibrium, auctions and applications, two sided markets, cake-cutting, cooperative games, voting games, multi-agent scheduling, price of stability, various mechanism design problems: online-dynamics and multi-stages as well as revenue maximization and resource allocation and applications. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] Algorithmic Game Theory : 11th International Symposium, SAGT 2018, Beijing, China, September 11-14, 2018, Proceedings [documento electrónico] / Deng, Xiaotie, . - 1 ed. . - [s.l.] : Springer, 2018 . - XX, 276 p. 29 ilustraciones.
ISBN : 978-3-319-99660-8
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
Idioma : Inglés (eng)
Palabras clave: Simulación por ordenador Red de computadoras Comercio electrónico TeorÃa de la codificación TeorÃa de la información Informática Matemáticas discretas Modelado por computadora Redes de comunicación informática comercio electrónico y negocios electrónicos TeorÃa de la codificación y la información Matemáticas discretas en informática Clasificación: 003.3 Resumen: Este libro constituye las actas arbitradas del 11.º Simposio Internacional sobre TeorÃa AlgorÃtmica de Juegos, SAGT 2018, celebrado en Beijing, China, en septiembre de 2018. Los 19 artÃculos completos presentados junto con 6 artÃculos breves y 5 charlas plenarias fueron cuidadosamente revisados ​​y seleccionados entre 54 presentaciones. Los artÃculos cubren varios aspectos importantes de la teorÃa algorÃtmica de juegos, incluido el equilibrio del mercado, subastas y aplicaciones, mercados bilaterales, corte de pasteles, juegos cooperativos, juegos de votación, programación de múltiples agentes, precio de estabilidad, diversos problemas de diseño de mecanismos: dinámica en lÃnea y múltiples etapas, asà como maximización de ingresos y asignación de recursos y aplicaciones. Nota de contenido: On Revenue Monotonicity in Combinatorial Auctions -- An Update on the Price of Stability -- Correlation-Robust Mechanism Design -- Job Security, Stability and Production Efficiency, with Applications to Auctions -- A Near Optimal Mechanism for Energy Aware Scheduling -- Information Elicitation for Bayesian Auctions -- The Complexity of Cake Cutting with Unequal Shares -- Resource Based Cooperative Games: Optimization, Fairness and Stability -- Coreness of Cooperative Games with Truncated Submodular Profit Functions -- Strategic Contention Resolution in Multiple Channelswith Limited Feedback -- Simple Games Versus Weighted Voting Games -- Hide and Seek Game with Multiple Resources -- An Improved Envy-Free Cake Cutting Protocol for Four Agents -- A Truthful Mechanism for Interval Scheduling -- On Revenue-Maximizing Mechanisms Assuming Convex Costs -- The Communication Burden of Single Transferable Vote, in Practice -- On the Price of Stability of Social Distance Games -- Schelling Segregation withStrategic Agents -- Efficient Rational Proofs with Strong Utility-Gap Guarantees -- Removal and Threshold Pricing: Truthful Two-sided Markets with Multi-dimensional Participants -- A Two-Stage Mechanism for Ordinal Peer Assessment -- Mechanism Design for Two-Opposite-Facility Location Games with Penalties on Distance -- The Equilibrium Existence of a Robust Routing Game Under Interval Uncertainty -- Online Trading as a Secretary Problem -- Constrained Swap Dynamics over a Social Network in Distributed Resource Reallocation -- A Hashing Power Allocation Game in Cryptocurrencies among Risk Neutral Miners -- What is the Optimal Deferral Number in Waitlist Mechanism -- An Optimal Strategy for Static Black-Peg Mastermind With Three Pegs -- Tight Bounds on the Relative Performances of Pricing Mechanisms in Storable Good Markets. Tipo de medio : Computadora Summary : This book constitutes the refereed proceedings of the 11th International Symposium on Algorithmic Game Theory, SAGT 2018, held in Beijing, China, in September 2018. The 19 full papers presented together with 6 short papers and 5 plenary talks were carefully reviewed and selected from 54 submissions. The papers cover various important aspects of algorithmic game theory including market equilibrium, auctions and applications, two sided markets, cake-cutting, cooperative games, voting games, multi-agent scheduling, price of stability, various mechanism design problems: online-dynamics and multi-stages as well as revenue maximization and resource allocation and applications. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]
TÃtulo : Frontiers in Algorithmics : 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings / Tipo de documento: documento electrónico Autores: Chen, Yijia, ; Deng, Xiaotie, ; Lu, Mei, Mención de edición: 1 ed. Editorial: [s.l.] : Springer Fecha de publicación: 2019 Número de páginas: X, 183 p. 83 ilustraciones, 19 ilustraciones en color. ISBN/ISSN/DL: 978-3-030-18126-0 Nota general: Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos. Idioma : Inglés (eng) Palabras clave: Algoritmos Informática Matemáticas discretas Análisis numérico Inteligencia artificial Red de computadoras Matemáticas discretas en informática Ciencia de los datos Redes de comunicación informática Clasificación: 518.1 Resumen: Este libro constituye las actas del 13.º Taller Internacional sobre Fronteras en AlgorÃtmica, FAW 2019, celebrado en Sanya, China, en abril/mayo de 2019. Los 15 artÃculos completos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 21 presentaciones. El taller proporciona un foro centrado en las tendencias actuales de la investigación sobre algoritmos, estructuras discretas y sus aplicaciones, y reúne a expertos internacionales en las fronteras de la investigación en estas áreas para intercambiar ideas y presentar nuevos resultados significativos. Nota de contenido: A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange -- A Local Search 4=3-Approximation Algorithm for the Minimum 3-Path Partition Problem -- Efficient Guarding of Polygons and Terrains -- Graph Orientation with Edge Modifications -- Local Coloring: New Observations and New Reductions -- Secure Computation of Any Boolean Function Based on Any Deck of Cards -- A Novel Business Model for Electric Car Sharing -- Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes- Read-Once Resolutions in Horn Formulas -- Vertex-Critical (P5 ,banner)-Free Graphs -- An FPTAS for Stochastic Unbounded Min-Knapsack Problem -- The Inapproximability of k-DominatingSet for Parameterized AC0 Circuits -- Mutual Visibility by Robots with Persistent Memory -- Pushing the Online Matrix-vector Conjecture Off-line and Identifying Its Easy Cases -- An Improved Approximation Algorithm for the k-Means Problem with Penalties. . Tipo de medio : Computadora Summary : This book constitutes the proceedings of the 13th International Workshop on Frontiers in Algorithmics, FAW 2019, held in Sanya, China, in April/May 2019. The 15 full papers presented in this volume were carefully reviewed and selected from 21 submissions. The workshop provides a focused forum on current trends of research on algorithms, discrete structures, and their applications, and brings together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...] Frontiers in Algorithmics : 13th International Workshop, FAW 2019, Sanya, China, April 29 – May 3, 2019, Proceedings / [documento electrónico] / Chen, Yijia, ; Deng, Xiaotie, ; Lu, Mei, . - 1 ed. . - [s.l.] : Springer, 2019 . - X, 183 p. 83 ilustraciones, 19 ilustraciones en color.
ISBN : 978-3-030-18126-0
Libro disponible en la plataforma SpringerLink. Descarga y lectura en formatos PDF, HTML y ePub. Descarga completa o por capítulos.
Idioma : Inglés (eng)
Palabras clave: Algoritmos Informática Matemáticas discretas Análisis numérico Inteligencia artificial Red de computadoras Matemáticas discretas en informática Ciencia de los datos Redes de comunicación informática Clasificación: 518.1 Resumen: Este libro constituye las actas del 13.º Taller Internacional sobre Fronteras en AlgorÃtmica, FAW 2019, celebrado en Sanya, China, en abril/mayo de 2019. Los 15 artÃculos completos presentados en este volumen fueron cuidadosamente revisados ​​y seleccionados entre 21 presentaciones. El taller proporciona un foro centrado en las tendencias actuales de la investigación sobre algoritmos, estructuras discretas y sus aplicaciones, y reúne a expertos internacionales en las fronteras de la investigación en estas áreas para intercambiar ideas y presentar nuevos resultados significativos. Nota de contenido: A Polynomial Time Algorithm for Fair Resource Allocation in Resource Exchange -- A Local Search 4=3-Approximation Algorithm for the Minimum 3-Path Partition Problem -- Efficient Guarding of Polygons and Terrains -- Graph Orientation with Edge Modifications -- Local Coloring: New Observations and New Reductions -- Secure Computation of Any Boolean Function Based on Any Deck of Cards -- A Novel Business Model for Electric Car Sharing -- Constructing Three Completely Independent Spanning Trees in Locally Twisted Cubes- Read-Once Resolutions in Horn Formulas -- Vertex-Critical (P5 ,banner)-Free Graphs -- An FPTAS for Stochastic Unbounded Min-Knapsack Problem -- The Inapproximability of k-DominatingSet for Parameterized AC0 Circuits -- Mutual Visibility by Robots with Persistent Memory -- Pushing the Online Matrix-vector Conjecture Off-line and Identifying Its Easy Cases -- An Improved Approximation Algorithm for the k-Means Problem with Penalties. . Tipo de medio : Computadora Summary : This book constitutes the proceedings of the 13th International Workshop on Frontiers in Algorithmics, FAW 2019, held in Sanya, China, in April/May 2019. The 15 full papers presented in this volume were carefully reviewed and selected from 21 submissions. The workshop provides a focused forum on current trends of research on algorithms, discrete structures, and their applications, and brings together international experts at the research frontiers in these areas to exchange ideas and to present significant new results. Enlace de acceso : https://link-springer-com.biblioproxy.umanizales.edu.co/referencework/10.1007/97 [...]