The following pages link to Paul G. Spirakis (Q389952):
Displaying 50 items.
- (Q169706) (redirect page) (← links)
- (Q239694) (redirect page) (← links)
- (Q1125794) (redirect page) (← links)
- Algorithms and almost tight results for 3-colorability of small diameter graphs (Q261372) (← links)
- Traveling salesman problems in temporal graphs (Q284573) (← links)
- On the hardness of network design for bottleneck routing games (Q389953) (← links)
- The computational power of simple protocols for self-awareness on graphs (Q392008) (← links)
- On mutual concavity and strategically-zero-sum bimatrix games (Q428856) (← links)
- Efficient methods for selfish network design (Q442104) (← links)
- Book review of: N. Nisan (ed.), T. Roughgarden (ed.), É. Tardos (ed.), V. Vazirani (ed.), Algorithmic game theory. Foreword by C. H. Papadimitriou (Q458474) (← links)
- A note on proofs of existence of Nash equilibria in finite strategic games, of two players (Q458483) (← links)
- Computational models for networks of tiny artifacts: a survey (Q465666) (← links)
- Innovative approaches for security of small artefacts (Q465672) (← links)
- Robust and scalable middleware for selfish-computer systems (Q465675) (← links)
- Selfish splittable flows and NP-completeness (Q465681) (← links)
- Approximating fixation probabilities in the generalized Moran process (Q472467) (← links)
- Computing approximate Nash equilibria in polymatrix games (Q513277) (← links)
- Determining majority in networks with local interactions and very small local memory (Q518677) (← links)
- On the chromatic number of non-sparse random intersection graphs (Q519889) (← links)
- Connectivity preserving network transformers (Q529024) (← links)
- Mediated population protocols (Q533894) (← links)
- On the performance of approximate equilibria in congestion games (Q634681) (← links)
- Passively mobile communicating machines that use restricted space (Q650876) (← links)
- On the independence number and Hamiltonicity of uniform random intersection graphs (Q650910) (← links)
- The fourth moment in Luby's distribution (Q672385) (← links)
- A 3-player protocol preventing persistence in strategic contention with limited feedback (Q681878) (← links)
- The impact of social ignorance on weighted congestion games (Q692896) (← links)
- Sharp thresholds for Hamiltonicity in random intersection graphs (Q708225) (← links)
- Strong NP-hardness of moving many discs (Q794168) (← links)
- The impact of network structure on the stability of greedy protocols (Q814919) (← links)
- The chromatic and clique numbers of random scaled sector graphs (Q817771) (← links)
- Maria Serna and her years in Patras (Q826321) (← links)
- Maximum cliques in graphs with small intersection number and random intersection graphs (Q826323) (← links)
- The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
- Radiocolorings in periodic planar graphs: PSPACE-completeness and efficient approximations for the optimal range of frequencies (Q849634) (← links)
- The infection time of graphs (Q858307) (← links)
- Performance and stability bounds for dynamic networks (Q878681) (← links)
- Causality, influence, and computation in possibly disconnected synchronous dynamic networks (Q897391) (← links)
- A network game with attackers and a defender (Q930603) (← links)
- Efficient sensor network design for continuous monitoring of moving objects (Q936530) (← links)
- Cost sharing mechanisms for fair pricing of resource usage (Q943873) (← links)
- Large independent sets in general random intersection graphs (Q952443) (← links)
- Random sampling of colourings of sparse random graphs with a constant number of colours (Q954987) (← links)
- Well supported approximate equilibria in bimatrix games (Q973002) (← links)
- Game authority for robust and scalable distributed selfish-computer systems (Q974739) (← links)
- Atomic congestion games: fast, myopic and concurrent (Q987399) (← links)
- The increase of the instability of networks due to quasi-static link capacities (Q995558) (← links)
- The price of selfish routing (Q996709) (← links)
- Computing on a partially eponymous ring (Q1004322) (← links)
- The price of optimum in Stackelberg games on arbitrary single commodity networks and latency functions (Q1006047) (← links)
- On the support size of stable strategies in random games (Q1006075) (← links)
- Polynomial algorithms for approximating Nash equilibria of bimatrix games (Q1014631) (← links)
