Algorithmic Game Theory [electronic resource] : 17th International Symposium, SAGT 2024, Amsterdam, The Netherlands, September 3-6, 2024, Proceedings / edited by Guido Schäfer, Carmine Ventre.

Colaborador(es): Schäfer, Guido [editor.] | Ventre, Carmine [editor.] | SpringerLink (Online service)Tipo de material: TextoTextoSeries Lecture Notes in Computer Science ; 15156Editor: Cham : Springer Nature Switzerland : Imprint: Springer, 2024Edición: 1st ed. 2024Descripción: XXI, 546 p. 55 illus., 34 illus. in color. online resourceTipo de contenido: text Tipo de medio: computer Tipo de portador: online resourceISBN: 9783031710339Tema(s): Computer simulation | Data structures (Computer science) | Information theory | Application software | Artificial intelligence | Algorithms | Computer networks  | Computer Modelling | Data Structures and Information Theory | Computer and Information Systems Applications | Artificial Intelligence | Design and Analysis of Algorithms | Computer Communication NetworksFormatos físicos adicionales: Printed edition:: Sin título; Printed edition:: Sin títuloClasificación CDD: 003.3 Clasificación LoC:QA76.9.C65Recursos en línea: Libro electrónicoTexto
Contenidos:
-- The Computational Complexity of the Housing Market. -- Ex-post Stability under Two-Sided Matching: Complexity and Characterization. -- Approval-Based Committee Voting under Uncertainty. -- Matching. -- Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem. -- Online Matching with High Probability. -- The Team Order Problem: Maximizing the Probability of Matching Being Large Enough. -- Fair Division and Resource Allocation. -- Fair Division of Chores with Budget Constraints. -- Fair Division with Interdependent Values. -- Fair Division with Bounded Sharing: Binary and Non-Degenerate Valuations. -- Incentives in Dominant Resource Fair Allocation under Dynamic Demands. -- Mechanism Design. -- Agent-Constrained Truthful Facility Location Games. -- The k-Facility Location Problem Via Optimal Transport: A Bayesian Study of the Percentile Mechanisms. -- Discrete Single-Parameter Optimal Auction Design. -- Estimating the Expected Social Welfare and Cost of Random Serial Dictatorship. -- Game Theory and Repeated Games. -- Swim Till You Sink: Computing the Limit of a Game. -- The Investment Management Game: Extending the Scope of the Notion of Core. -- Edge-Dominance Games on Graphs. -- Playing Repeated Games with Sublinear Randomness. -- Pricing, Revenue, and Regulation. -- Mind the Revenue Gap: On the Performance of Approximation Mechanisms under Budget Constraints. -- Sublogarithmic Approximation for Tollbooth Pricing on a Cactus. -- To Regulate or Not to Regulate: Using Revenue Maximization Tools to Maximize Consumer Utility. -- Balancing Participation and Decentralization in Proof-of-Stake Cryptocurrencies. -- Matroid Theory in Game Theory. -- Price of Anarchy in Paving Matroid Congestion Games. -- Price of Anarchy for Graphic Matroid Congestion Games. -- Non-Adaptive Matroid Prophet Inequalities. -- Matroid Bayesian Online Selection. -- Information Sharing and Decision Making. -- Prediction-Sharing During Training and Inference. -- Calibrated Recommendations for Users with Decaying Attention. -- Matrix Rationalization via Partial Orders. -- Computational Complexity and Resource Allocation. -- k-Times Bin-Packing and its Application to Fair Electricity Distribution. -- Condorcet Markets. -- Complexity of Round-Robin Allocation with Potentially Noisy Queries.
En: Springer Nature eBookResumen: This volume constitutes the refereed proceedings of 17th International Symposium on Algorithmic Game Theory, SAGT 2024, held in Amsterdam, The Netherlands, during September 3-6, 2024. The 29 full papers included in this book were carefully reviewed and selected from 84 submissions. They were organized in topical sections as follows: matching; fair division and resource allocation; mechanism design; game theory and repeated games; pricing, revenue, and regulation; matroid theory in game theory; information sharing and decision making; computational complexity and resource allocation.
Star ratings
    Valoración media: 0.0 (0 votos)
Existencias
Tipo de ítem Biblioteca actual Colección Signatura Copia número Estado Fecha de vencimiento Código de barras
Libro Electrónico Biblioteca Electrónica
Colección de Libros Electrónicos 1 No para préstamo

-- The Computational Complexity of the Housing Market. -- Ex-post Stability under Two-Sided Matching: Complexity and Characterization. -- Approval-Based Committee Voting under Uncertainty. -- Matching. -- Structural and Algorithmic Results for Stable Cycles and Partitions in the Roommates Problem. -- Online Matching with High Probability. -- The Team Order Problem: Maximizing the Probability of Matching Being Large Enough. -- Fair Division and Resource Allocation. -- Fair Division of Chores with Budget Constraints. -- Fair Division with Interdependent Values. -- Fair Division with Bounded Sharing: Binary and Non-Degenerate Valuations. -- Incentives in Dominant Resource Fair Allocation under Dynamic Demands. -- Mechanism Design. -- Agent-Constrained Truthful Facility Location Games. -- The k-Facility Location Problem Via Optimal Transport: A Bayesian Study of the Percentile Mechanisms. -- Discrete Single-Parameter Optimal Auction Design. -- Estimating the Expected Social Welfare and Cost of Random Serial Dictatorship. -- Game Theory and Repeated Games. -- Swim Till You Sink: Computing the Limit of a Game. -- The Investment Management Game: Extending the Scope of the Notion of Core. -- Edge-Dominance Games on Graphs. -- Playing Repeated Games with Sublinear Randomness. -- Pricing, Revenue, and Regulation. -- Mind the Revenue Gap: On the Performance of Approximation Mechanisms under Budget Constraints. -- Sublogarithmic Approximation for Tollbooth Pricing on a Cactus. -- To Regulate or Not to Regulate: Using Revenue Maximization Tools to Maximize Consumer Utility. -- Balancing Participation and Decentralization in Proof-of-Stake Cryptocurrencies. -- Matroid Theory in Game Theory. -- Price of Anarchy in Paving Matroid Congestion Games. -- Price of Anarchy for Graphic Matroid Congestion Games. -- Non-Adaptive Matroid Prophet Inequalities. -- Matroid Bayesian Online Selection. -- Information Sharing and Decision Making. -- Prediction-Sharing During Training and Inference. -- Calibrated Recommendations for Users with Decaying Attention. -- Matrix Rationalization via Partial Orders. -- Computational Complexity and Resource Allocation. -- k-Times Bin-Packing and its Application to Fair Electricity Distribution. -- Condorcet Markets. -- Complexity of Round-Robin Allocation with Potentially Noisy Queries.

This volume constitutes the refereed proceedings of 17th International Symposium on Algorithmic Game Theory, SAGT 2024, held in Amsterdam, The Netherlands, during September 3-6, 2024. The 29 full papers included in this book were carefully reviewed and selected from 84 submissions. They were organized in topical sections as follows: matching; fair division and resource allocation; mechanism design; game theory and repeated games; pricing, revenue, and regulation; matroid theory in game theory; information sharing and decision making; computational complexity and resource allocation.

UABC ; Perpetuidad

Con tecnología Koha