Searching for authors named "Elias Koutsoupias" – sorted by Relevance.
34 documents found, showing 1 through 10.
Next 10 →
-
Selfish task allocation
- ……
- Cited by 2 (1 self) – Add To MetaCart
-
Coordination mechanisms for congestion games
- ……
- Cited by 2 (0 self) – Add To MetaCart
-
On the competitive ratio of the work function algorithm for the k-server problem
- …The k-server problem is one of the most fundamental online problems. The problem is to schedule k mobile servers to visit a sequence of points in a metric space with minimum total mileage. The k-server conjecture of Manasse, McGeogh, and Sleator states that there exists a k-competitive online algori…
- Cited by 4 (0 self) – Add To MetaCart
-
On Uniform Protocols
- …We introduce the notion of a task for infinitely many processors and investigate necessary and sufficient conditions for such a task to be wait--free solvable. A protocol that solves such a task must be uniform: Processors must produce a valid output even when there is no upper bound on the cardi…
- Cited by 2 (2 self) – Add To MetaCart
-
The Online Matching Problem on a Line ⋆
- …Abstract. We study the online matching problem when the metric space is a single straight line. For this case, the offline matching problem is trivial but the online problem has been open and the best known competitive ratio was the trivial Θ(n) where n is the number of requests. It was conjectured …
- Cited by 1 (0 self) – Add To MetaCart
-
Three-Processor Tasks Are Undecidable
- …We show that no algorithm exists for deciding whether a finite task for three or more processors is wait-free solvable in the asynchronous read-write shared-memory model. This impossibility result implies that there is no constructive (recursive) characterization of wait-free solvable tasks. It also…
- Cited by 15 (2 self) – Add To MetaCart
-
Beyond Competitive Analysis
- …The competitive analysis of on-line algorithms has been criticized as being too crude and unrealistic. We propose renements of competitive analysis in two directions: The rst restricts the power of the adversary by allowing only certain input distributions, while the other allows for comparisons bet…
- Cited by 90 (3 self) – Add To MetaCart
-
A lower bound of 1+φ for truthful scheduling mechanisms
- …Abstract. We give an improved lower bound for the approximation ratio of truthful mechanisms for the unrelated machines scheduling problem. The mechanism design version of the problem which was proposed and studied in a seminal paper of Nisan and Ronen is at the core of the emerging area of Algorith…
- Cited by 2 (0 self) – Add To MetaCart
-
Worst-case equilibria
- …Abstract. In a system in which noncooperative agents share a common resource, we propose the ratio between the worst possible Nash equilibrium and the social optimum as a measure of the e ectiveness of the system. Deriving upper and lower bounds for this ratio in a model in which several agents shar…
- Cited by 324 (15 self) – Add To MetaCart
Showing 1 through 10.
Next 10 →
