Info
- Utilizzare la checkbox di selezione a fianco di ciascun documento per attivare le funzionalità di stampa, invio email, download nei formati disponibili del (i) record.
Algorithmic Game Theory [[electronic resource] ] : Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009, Proceedings / / edited by Marios Mavronicolas, Maria Papadoupoulou
| Algorithmic Game Theory [[electronic resource] ] : Second International Symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009, Proceedings / / edited by Marios Mavronicolas, Maria Papadoupoulou |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 |
| Descrizione fisica | 1 online resource (XI, 359 p.) |
| Disciplina | 003.3 |
| Collana | Theoretical Computer Science and General Issues |
| Soggetto topico |
Computer simulation
Application software Computers and civilization Electronic commerce Computer science Numerical analysis Computer Modelling Computer and Information Systems Applications Computers and Society e-Commerce and e-Business Models of Computation Numerical Analysis |
| ISBN | 3-642-04645-2 |
| Classificazione |
DAT 530f
MAT 920f SK 860 SS 4800 |
| Formato | Materiale a stampa  |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Monotonicity in Mechanism Design -- Computational Aspects of Equilibria -- A Modular Approach to Roberts’ Theorem -- Characterizing Incentive Compatibility for Convex Valuations -- Truthful Mechanisms for Selfish Routing and Two-Parameter Agents -- Partition Equilibrium -- Better with Byzantine: Manipulation-Optimal Mechanisms -- On the Planner’s Loss Due to Lack of Information in Bayesian Mechanism Design -- Sequential Pivotal Mechanisms for Public Project Problems -- Characterizing the Existence of Potential Functions in Weighted Congestion Games -- Free-Riding and Free-Labor in Combinatorial Agency -- The Cost of Stability in Coalitional Games -- Non-clairvoyant Scheduling Games -- The Balloon Popping Problem Revisited: Lower and Upper Bounds -- Anarchy, Stability, and Utopia: Creating Better Matchings -- Equilibria in Dynamic Selfish Routing -- Stochastic Stability in Internet Router Congestion Games -- Nash Dynamics in Constant Player and Bounded Jump Congestion Games -- Price of Stability in Survivable Network Design -- Games with Congestion-Averse Utilities -- A New Derandomization of Auctions -- The Computational Complexity of Weak Saddles -- Learning and Approximating the Optimal Strategy to Commit To -- Doing Good with Spam Is Hard -- On Profit-Maximizing Pricing for the Highway and Tollbooth Problems -- On the Complexity of Iterated Weak Dominance in Constant-Sum Games -- Swap Bribery -- Performances of One-Round Walks in Linear Congestion Games -- Nash Equilibria and the Price of Anarchy for Flows over Time -- Bayesian Auctions with Friends and Foes -- On Equilibria for ADM Minimization Games. |
| Record Nr. | UNISA-996465279503316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithmic game theory : second international symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009 ; proceedings / / Marios Mavronicolas, Vicky G. Papadopoulou, eds
| Algorithmic game theory : second international symposium, SAGT 2009, Paphos, Cyprus, October 18-20, 2009 ; proceedings / / Marios Mavronicolas, Vicky G. Papadopoulou, eds |
| Edizione | [1st ed. 2009.] |
| Pubbl/distr/stampa | New York, : Springer, 2009 |
| Descrizione fisica | 1 online resource (XI, 359 p.) |
| Disciplina | 003.3 |
| Altri autori (Persone) |
MavronicolasMarios
PapadopoulouVicky G |
| Collana | Lecture notes in computer science |
| Soggetto topico |
Game theory
Algorithms |
| ISBN | 3-642-04645-2 |
| Classificazione |
DAT 530f
MAT 920f SK 860 SS 4800 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Monotonicity in Mechanism Design -- Computational Aspects of Equilibria -- A Modular Approach to Roberts’ Theorem -- Characterizing Incentive Compatibility for Convex Valuations -- Truthful Mechanisms for Selfish Routing and Two-Parameter Agents -- Partition Equilibrium -- Better with Byzantine: Manipulation-Optimal Mechanisms -- On the Planner’s Loss Due to Lack of Information in Bayesian Mechanism Design -- Sequential Pivotal Mechanisms for Public Project Problems -- Characterizing the Existence of Potential Functions in Weighted Congestion Games -- Free-Riding and Free-Labor in Combinatorial Agency -- The Cost of Stability in Coalitional Games -- Non-clairvoyant Scheduling Games -- The Balloon Popping Problem Revisited: Lower and Upper Bounds -- Anarchy, Stability, and Utopia: Creating Better Matchings -- Equilibria in Dynamic Selfish Routing -- Stochastic Stability in Internet Router Congestion Games -- Nash Dynamics in Constant Player and Bounded Jump Congestion Games -- Price of Stability in Survivable Network Design -- Games with Congestion-Averse Utilities -- A New Derandomization of Auctions -- The Computational Complexity of Weak Saddles -- Learning and Approximating the Optimal Strategy to Commit To -- Doing Good with Spam Is Hard -- On Profit-Maximizing Pricing for the Highway and Tollbooth Problems -- On the Complexity of Iterated Weak Dominance in Constant-Sum Games -- Swap Bribery -- Performances of One-Round Walks in Linear Congestion Games -- Nash Equilibria and the Price of Anarchy for Flows over Time -- Bayesian Auctions with Friends and Foes -- On Equilibria for ADM Minimization Games. |
| Record Nr. | UNINA-9910484630303321 |
| New York, : Springer, 2009 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Algorithms and complexity : 13th international conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, proceedings / / edited by Marios Mavronicolas
| Algorithms and complexity : 13th international conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, proceedings / / edited by Marios Mavronicolas |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2023] |
| Descrizione fisica | 1 online resource (412 pages) |
| Disciplina | 069 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Algorithms |
| ISBN |
9783031304484
9783031304477 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Unifying Gathering Strategies for Swarms of Mobile Robots -- The Complexity of Secure RAMs -- Selected Combinatorial Problems Through the Prism of Random Intersection Graphs Models -- The power of the Binary Value Principle -- Independent Set under a Change Constraint from an Initial Solution -- Asynchronous Fully-Decentralized SGD in the Cluster-Based Model -- Non-Crossing Shortest Paths Lengths in Planar Graphs in Linear Time -- How Vulnerable is an Undirected Planar Graph with respect to Max Flow -- Maximum Flows in Parametric Graph Templates -- Dynamic Coloring on Restricted Graph Classes -- Enumeration of Minimal Tropical Connected Sets -- Dynamic Flows with Time-Dependent Capacities -- On One-Sided Testing Affine Subspaces -- Stable Scheduling in Transactional Memory -- Parameterizing Path Partitions -- Maintaining Triconnected Components under Node Expansion -- Approximating Power Node-Deletion Problems -- Phase transition in count approximation by Count-Min sketch with conservative updates -- Minimum-link ´ $C$-Oriented Paths Visiting a Sequence of Regions in the Plane -- Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond -- Broadcasting in Split Graphs -- Partitioning Subclasses of Chordal Graphs with Few Deletions -- Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision -- Improved Deterministic Leader Election in Diameter-Two Networks -- Fast Cauchy Sum Algorithms for Polynomial Zeros and Matrix Eigenvalues -- On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves -- Efficiently Enumerating All Spanning Trees of a Plane 3-Tree -- Communication-Efficient Distributed Graph Clustering and Sparsification under Duplication Models. |
| Record Nr. | UNISA-996525671503316 |
| Cham, Switzerland : , : Springer, , [2023] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Algorithms and complexity : 13th international conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, proceedings / / edited by Marios Mavronicolas
| Algorithms and complexity : 13th international conference, CIAC 2023, Larnaca, Cyprus, June 13-16, 2023, proceedings / / edited by Marios Mavronicolas |
| Edizione | [1st ed. 2023.] |
| Pubbl/distr/stampa | Cham, Switzerland : , : Springer, , [2023] |
| Descrizione fisica | 1 online resource (412 pages) |
| Disciplina | 069 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico | Algorithms |
| ISBN |
9783031304484
9783031304477 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Unifying Gathering Strategies for Swarms of Mobile Robots -- The Complexity of Secure RAMs -- Selected Combinatorial Problems Through the Prism of Random Intersection Graphs Models -- The power of the Binary Value Principle -- Independent Set under a Change Constraint from an Initial Solution -- Asynchronous Fully-Decentralized SGD in the Cluster-Based Model -- Non-Crossing Shortest Paths Lengths in Planar Graphs in Linear Time -- How Vulnerable is an Undirected Planar Graph with respect to Max Flow -- Maximum Flows in Parametric Graph Templates -- Dynamic Coloring on Restricted Graph Classes -- Enumeration of Minimal Tropical Connected Sets -- Dynamic Flows with Time-Dependent Capacities -- On One-Sided Testing Affine Subspaces -- Stable Scheduling in Transactional Memory -- Parameterizing Path Partitions -- Maintaining Triconnected Components under Node Expansion -- Approximating Power Node-Deletion Problems -- Phase transition in count approximation by Count-Min sketch with conservative updates -- Minimum-link ´ $C$-Oriented Paths Visiting a Sequence of Regions in the Plane -- Grouped Domination Parameterized by Vertex Cover, Twin Cover, and Beyond -- Broadcasting in Split Graphs -- Partitioning Subclasses of Chordal Graphs with Few Deletions -- Complete Decomposition of Symmetric Tensors in Linear Time and Polylogarithmic Precision -- Improved Deterministic Leader Election in Diameter-Two Networks -- Fast Cauchy Sum Algorithms for Polynomial Zeros and Matrix Eigenvalues -- On the Parameterized Complexity of the Structure of Lineal Topologies (Depth-First Spanning Trees) of Finite Graphs: The Number of Leaves -- Efficiently Enumerating All Spanning Trees of a Plane 3-Tree -- Communication-Efficient Distributed Graph Clustering and Sparsification under Duplication Models. |
| Record Nr. | UNINA-9910717420803321 |
| Cham, Switzerland : , : Springer, , [2023] | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Distributed Algorithms [[electronic resource] ] : 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings / / edited by Marios Mavronicolas, Philippas Tsigas
| Distributed Algorithms [[electronic resource] ] : 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings / / edited by Marios Mavronicolas, Philippas Tsigas |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XI, 341 p.) |
| Disciplina | 004/.36 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer communication systems Software engineering Algorithms Computer programming Theory of Computation Computer Communication Networks Software Engineering/Programming and Operating Systems Algorithm Analysis and Problem Complexity Programming Techniques Computation by Abstract Devices |
| ISBN | 3-540-69600-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Towards fault-tolerant and secure agentry -- Workflow management — An exercise in distributed computing -- In memory of Anya Pogosyants -- Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study -- A simple DFS-Based algorithm for linear interval routing -- ATM layouts with bounded hop count and congestion -- Scheduling in synchronous networks and the greedy algorithm -- Rapid convergence of a local load balancing algorithm for asynchronous rings -- Performing tasks on restartable message-passing processors -- Revisiting the Paxos algorithm -- Heartbeat: A timeout-free failure detector for quiescent reliable communication -- Genuine atomic multicast -- Low-overhead time-triggered group membership -- Virtual precedence in asynchronous systems: Concept and applications -- Detecting global predicates in distributed systems with clocks -- Fault tolerance bounds for memory consistency -- Precedence-based memory models -- Strong interaction fairness in a fully distributed system with unbounded speed variability -- Reliable communication over partially authenticated networks -- Self-stabilizing depth-first token passing on rooted networks -- Secure distributed storage and retrieval -- Optimal wait-free clock synchronization protocol on a shared-memory multi-processor system -- Transparent support for wait-free transactions -- On the power of multi-objects. |
| Record Nr. | UNISA-996465521903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Distributed Algorithms [[electronic resource] ] : 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings / / edited by Marios Mavronicolas, Philippas Tsigas
| Distributed Algorithms [[electronic resource] ] : 11th International Workshop, WDAG '97, Saarbrücken, Germany, September 24-26, 1997, Proceedings / / edited by Marios Mavronicolas, Philippas Tsigas |
| Edizione | [1st ed. 1997.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 |
| Descrizione fisica | 1 online resource (XI, 341 p.) |
| Disciplina | 004/.36 |
| Collana | Lecture Notes in Computer Science |
| Soggetto topico |
Computers
Computer communication systems Software engineering Algorithms Computer programming Theory of Computation Computer Communication Networks Software Engineering/Programming and Operating Systems Algorithm Analysis and Problem Complexity Programming Techniques Computation by Abstract Devices |
| ISBN | 3-540-69600-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Towards fault-tolerant and secure agentry -- Workflow management — An exercise in distributed computing -- In memory of Anya Pogosyants -- Verification of the randomized consensus algorithm of Aspnes and Herlihy: A case study -- A simple DFS-Based algorithm for linear interval routing -- ATM layouts with bounded hop count and congestion -- Scheduling in synchronous networks and the greedy algorithm -- Rapid convergence of a local load balancing algorithm for asynchronous rings -- Performing tasks on restartable message-passing processors -- Revisiting the Paxos algorithm -- Heartbeat: A timeout-free failure detector for quiescent reliable communication -- Genuine atomic multicast -- Low-overhead time-triggered group membership -- Virtual precedence in asynchronous systems: Concept and applications -- Detecting global predicates in distributed systems with clocks -- Fault tolerance bounds for memory consistency -- Precedence-based memory models -- Strong interaction fairness in a fully distributed system with unbounded speed variability -- Reliable communication over partially authenticated networks -- Self-stabilizing depth-first token passing on rooted networks -- Secure distributed storage and retrieval -- Optimal wait-free clock synchronization protocol on a shared-memory multi-processor system -- Transparent support for wait-free transactions -- On the power of multi-objects. |
| Record Nr. | UNINA-9910768453303321 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 1997 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||
Internet and Network Economics [[electronic resource] ] : Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings / / edited by Paul Spirakis, Marios Mavronicolas, Spyros Kontogiannis
| Internet and Network Economics [[electronic resource] ] : Second International Workshop, WINE 2006, Patras, Greece, December 15-17, 2006, Proceedings / / edited by Paul Spirakis, Marios Mavronicolas, Spyros Kontogiannis |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 |
| Descrizione fisica | 1 online resource (XI, 404 p.) |
| Disciplina | 004.67/8 |
| Collana | Information Systems and Applications, incl. Internet/Web, and HCI |
| Soggetto topico |
Computer science
Computer communication systems Application software Computers and civilization E-commerce Popular Computer Science Computer Communication Networks Information Systems Applications (incl. Internet) Computers and Society Computer Appl. in Administrative Data Processing e-Commerce/e-business |
| ISBN | 3-540-68141-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Recent Developments in Learning and Competition with Finite Automata (Extended Abstract) -- Dynamic Mechanism Design -- Unconditional Competitive Auctions with Copy and Budget Constraints -- Truthful Auctions with Optimal Profit -- Mechanisms with Verification for Any Finite Domain -- Pure Nash Equilibria in Player-Specific and Weighted Congestion Games -- On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games -- Strong and Correlated Strong Equilibria in Monotone Congestion Games -- The Equilibrium Existence Problem in Finite Network Congestion Games -- First-Passage Percolation on a Width-2 Strip and the Path Cost in a VCG Auction -- Optimal Cost-Sharing Mechanisms for Steiner Forest Problems -- Mechanisms to Induce Random Choice -- Bayesian Optimal No-Deficit Mechanism Design -- Succinct Approximation of Trade-Off Curves -- Game-Theoretic Aspects of Designing Hyperlink Structures -- Competing for Customers in a Social Network: The Quasi-linear Case -- Selfish Service Installation in Networks -- Games of Connectivity -- Assignment Problems in Rental Markets -- On Portfolio’s Default-Risk-Adjusted Duration and Value: Model and Algorithm Based on Copulas -- Price Roll-Backs and Path Auctions: An Approximation Scheme for Computing the Market Equilibrium -- New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets -- Making Economic Theory Operational -- Sparse Games Are Hard -- Market Equilibria with Hybrid Linear-Leontief Utilities -- Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games -- A Note on Approximate Nash Equilibria -- Ranking Sports Teams and the Inverse Equal Paths Problem -- Price of Anarchy for Polynomial Wardrop Games -- Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic -- A Worm Propagation Model Based on People’s Email Acquaintance Profiles -- Mixed Strategies in Combinatorial Agency -- The Sound of Silence: Mining Implicit Feedbacks to Compute Reputation -- Strongly Polynomial-Time Truthful Mechanisms in One Shot -- Secretary Problems with Competing Employers. |
| Record Nr. | UNISA-996466157903316 |
| Berlin, Heidelberg : , : Springer Berlin Heidelberg : , : Imprint : Springer, , 2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. di Salerno | ||
| ||
Internet and network economics : second international workshop, WINE 2006, Patras, Greece, December 15-17, 2006 : proceedings / / Paul Spirakis, Marios Mavronicolas, Spyros Kontogiannis (eds.)
| Internet and network economics : second international workshop, WINE 2006, Patras, Greece, December 15-17, 2006 : proceedings / / Paul Spirakis, Marios Mavronicolas, Spyros Kontogiannis (eds.) |
| Edizione | [1st ed. 2006.] |
| Pubbl/distr/stampa | Berlin ; ; New York, : Springer, c2006 |
| Descrizione fisica | 1 online resource (XI, 404 p.) |
| Disciplina | 004.67/8 |
| Altri autori (Persone) |
SpirakisP. G <1955-> (Paul G.)
MavronicolasMarios KontogiannisSpyros |
| Collana |
Lecture notes in computer science
LNCS sublibrary. SL 3, Information systems and application, incl. Internet/Web, and HCI |
| Soggetto topico |
Internet
Computer networks - Economic aspects Econometrics |
| ISBN | 3-540-68141-8 |
| Formato | Materiale a stampa |
| Livello bibliografico | Monografia |
| Lingua di pubblicazione | eng |
| Nota di contenuto | Recent Developments in Learning and Competition with Finite Automata (Extended Abstract) -- Dynamic Mechanism Design -- Unconditional Competitive Auctions with Copy and Budget Constraints -- Truthful Auctions with Optimal Profit -- Mechanisms with Verification for Any Finite Domain -- Pure Nash Equilibria in Player-Specific and Weighted Congestion Games -- On the Complexity of Pure-Strategy Nash Equilibria in Congestion and Local-Effect Games -- Strong and Correlated Strong Equilibria in Monotone Congestion Games -- The Equilibrium Existence Problem in Finite Network Congestion Games -- First-Passage Percolation on a Width-2 Strip and the Path Cost in a VCG Auction -- Optimal Cost-Sharing Mechanisms for Steiner Forest Problems -- Mechanisms to Induce Random Choice -- Bayesian Optimal No-Deficit Mechanism Design -- Succinct Approximation of Trade-Off Curves -- Game-Theoretic Aspects of Designing Hyperlink Structures -- Competing for Customers in a Social Network: The Quasi-linear Case -- Selfish Service Installation in Networks -- Games of Connectivity -- Assignment Problems in Rental Markets -- On Portfolio’s Default-Risk-Adjusted Duration and Value: Model and Algorithm Based on Copulas -- Price Roll-Backs and Path Auctions: An Approximation Scheme for Computing the Market Equilibrium -- New Results on Rationality and Strongly Polynomial Time Solvability in Eisenberg-Gale Markets -- Making Economic Theory Operational -- Sparse Games Are Hard -- Market Equilibria with Hybrid Linear-Leontief Utilities -- Polynomial Algorithms for Approximating Nash Equilibria of Bimatrix Games -- A Note on Approximate Nash Equilibria -- Ranking Sports Teams and the Inverse Equal Paths Problem -- Price of Anarchy for Polynomial Wardrop Games -- Wardrop Equilibria and Price of Stability for Bottleneck Games with Splittable Traffic -- A Worm Propagation Model Based on People’s Email Acquaintance Profiles -- Mixed Strategies in Combinatorial Agency -- The Sound of Silence: Mining Implicit Feedbacks to Compute Reputation -- Strongly Polynomial-Time Truthful Mechanisms in One Shot -- Secretary Problems with Competing Employers. |
| Altri titoli varianti | WINE 2006 |
| Record Nr. | UNINA-9910484935903321 |
| Berlin ; ; New York, : Springer, c2006 | ||
| Materiale a stampa | ||
| Lo trovi qui: Univ. Federico II | ||
| ||