A Glimpse at Paul G. Spirakis
From MaRDI portal
Publication:3464465
DOI10.1007/978-3-319-24024-4_1zbMath1331.01014OpenAlexW1449847674WikidataQ57607956 ScholiaQ57607956MaRDI QIDQ3464465
Dimitris Fotakis, Othon Michail, Ioannis Chatzigiannakis, Spyros C. Kontogiannis, Christos D. Zaroliagis, Sotiris E. Nikoletseas, Grammati E. Pantziou
Publication date: 27 January 2016
Published in: Algorithms, Probability, Networks, and Games (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-319-24024-4_1
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Approximate well-supported Nash equilibria below two-thirds
- Efficient methods for selfish network design
- Approximating fixation probabilities in the generalized Moran process
- Connectivity preserving network transformers
- Mediated population protocols
- On the performance of approximate equilibria in congestion games
- Characterizing the existence of potential functions in weighted congestion games
- Passively mobile communicating machines that use restricted space
- The impact of social ignorance on weighted congestion games
- The impact of network structure on the stability of greedy protocols
- The structure and complexity of Nash equilibria for a selfish routing game
- Games of fixed rank: a hierarchy of bimatrix games
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks
- The price of selfish routing
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions
- A note on approximate Nash equilibria
- Polynomial algorithms for approximating Nash equilibria of bimatrix games
- Optimal parallel randomized algorithms for sparse addition and identification
- BSP versus LogP
- On the random generation and counting of matchings in dense graphs
- Strategically zero-sum games: The class of games whose completely mixed equilibria cannot be improved upon
- Expected parallel time and sequential space complexity of graph and digraph problems
- Efficient parallel algorithms for shortest paths in planar digraphs
- Lower bounds and efficient algorithms for multiprocessor scheduling of directed acyclic graphs with communication delays
- Hammock-on-ears decomposition: A technique for the efficient parallel solution of shortest paths and other problems
- Distributed communication algorithms for ad hoc mobile networks.
- Efficient scheduling of strict multithreaded computations
- Random bimatrix games are asymptotically easy to solve (a simple proof)
- Approximate equilibria and ball fusion
- Competitive call control in mobile networks
- Attack propagation in networks
- Natural models for evolution on networks
- Computation in networks of passively mobile finite-state sensors
- Two-person nonzero-sum games and quadratic programming
- Radiocoloring in planar graphs: Complexity and approximations
- Selfish unsplittable flows
- Non-cooperative games
- Traveling Salesman Problems in Temporal Graphs
- Polylogarithmic Supports Are Required for Approximate Well-Supported Nash Equilibria below 2/3
- Naming and Counting in Anonymous Unknown Dynamic Networks
- Real-Time Synchronization of Interprocess Communications
- Unbounded Speed Variability in Distributed Communications Systems
- On Convergence and Threshold Properties of Discrete Lotka-Volterra Population Protocols
- Settling the complexity of computing two-player Nash equilibria
- An Introduction to Temporal Graphs: An Algorithmic Perspective
- Algorithms for pure Nash equilibria in weighted congestion games
- Atomic Congestion Games Among Coalitions
- Parallel Complexity of the Connected Subgraph Problem
- Tail bounds for occupancy and the satisfiability threshold conjecture
- Determining Majority in Networks with Local Interactions and Very Small Local Memory
- The Complexity of Computing a Nash Equilibrium
- Temporal Network Optimization Subject to Connectivity Constraints
- Automata, Languages and Programming
- Simple and efficient local codes for distributed stable network construction
- Connectivity and inference problems for temporal networks
This page was built for publication: A Glimpse at Paul G. Spirakis
