#### Filter Results:

- Full text PDF available (255)

#### Publication Year

1980

2017

- This year (11)
- Last 5 years (60)
- Last 10 years (173)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Haralampos Tsaknakis, Paul G. Spirakis
- WINE
- 2007

In this paper we propose a new methodology for determining approximate Nash equilibria of non-cooperative bimatrix games and, based on that, we provide an efficient algorithm that computes 0.3393-approximate equilibria, the best approximation till now. The methodology is based on the formulation of an appropriate function of pairs of mixed strategies… (More)

- Daniel Kornhauser, Gary L. Miller, Paul G. Spirakis
- FOCS
- 1984

- Dimitris Fotakis, Rasmus Pagh, Peter Sanders, Paul G. Spirakis
- Theory of Computing Systems
- 2003

We generalize Cuckoo Hashing to d-ary Cuckoo Hashing and show how this yields a simple hash table data structure that stores n elements in (1 + ε)n memory cells, for any constant ε > 0. Assuming uniform hashing, accessing or deleting table entries takes at most d=O (ln (1/ε)) probes and the expected amortized insertion time is constant. This is the first… (More)

- Dimitris Fotakis, Spyros C. Kontogiannis, Paul G. Spirakis
- Theor. Comput. Sci.
- 2004

What is the price of anarchy when unsplittable demands are routed selfishly in general networks with load-dependent edge delays? Motivated by this question we generalize the model of [14] to the case of weighted congestion games. We show that varying demands of users crucially affect the nature of these games, which are no longer isomorphic to exact… (More)

The classical occupancy problem is concerned with studying the number of empty bins resulting from a random allocation of m balls to n bins. We provide a series of tail bounds on the distribution of the number of empty bins. These tail bounds should find application in randomized algorithms and probabilistic analysis. Our motivating application is the… (More)

In this work, we study the combinatorial structure and the computational complexity of Nash equilibria for a certain game that models selfish routing over a network consisting of m parallel links. We assume a collection of n users, each employing a mixed strategy, which is a probability distribution over links, to control the routing of its own assigned… (More)

- Charilaos Efthymiou, Paul G. Spirakis
- ICALP
- 2005

In this work we propose simple and efficient protocols for counting and leader election in mobile networks. For mobile networks with fixed base stations we provide a new and very efficient protocol for counting the number of mobile hosts. The main part of the work concentrates on ad-hoc networks (no fixed subnetwork). We provide a model for these networks… (More)

In this paper, we analyze the stability properties of the FIFO protocol in the Adversarial Queueing model for packet routing. We show a graph for which FIFO is stable for any adversary with injection rate <i>r</i> ≰ 0.1428. We generalize this results to show upper bound for stability of any network under FIFO protocol, answering partially an open… (More)

- Lefteris M. Kirousis, Paul G. Spirakis, Philippas Tsigas
- IEEE Trans. Parallel Distrib. Syst.
- 1991

We address the problem of reading more than one variables (components) X 1 ; : : : ; X c , all in one atomic operation, by only one process called the reader, while each of these variables are being written by a set of writers. All operations (i.e. both reads and writes) are assumed to be totally asynchronous and wait-free. For this problem, only algorithms… (More)