STACS 2004

We survey results on determinacy of games and on the existence of positional winning strategies for parity games and Rabin games. We will then discuss some new developments concerning positional determinacy for path games and for Muller games with infinitely many priorities.

[1]  Jirí Sgall,et al.  A lower bound for on-line scheduling on uniformly related machines , 2000, Oper. Res. Lett..

[2]  Teofilo F. Gonzalez,et al.  Preemptive Scheduling of Uniform Processor Systems , 1978, JACM.

[3]  David P. Williamson,et al.  Scheduling parallel machines on-line , 1991, [1991] Proceedings 32nd Annual Symposium of Foundations of Computer Science.

[4]  Jean-Luc Ville.  Étude critique de la notion de collectif , 1939 .

[5]  Jon M. Kleinberg,et al.  An improved approximation ratio for the minimum latency problem , 1996, SODA '96.

[6]  Nathan Linial,et al.  The geometry of graphs and some of its algorithmic applications , 1994, Proceedings 35th Annual Symposium on Foundations of Computer Science.

[7]  J. M. Moore,et al.  A Functional Equation and its Application to Resource Allocation and Sequencing Problems , 1969 .

[8]  E. L. Lawler,et al.  A fully polynomial approximation scheme for the total tardiness problem , 1982, Oper. Res. Lett..

[9]  Donglei Du,et al.  Preemptive on-line scheduling for two uniform processors , 1998, Oper. Res. Lett..

[10]  E. Lawler.  A “Pseudopolynomial” Algorithm for Sequencing Jobs to Minimize Total Tardiness , 1977 .

[11]  Jan Karel Lenstra,et al.  Complexity of machine scheduling problems , 1975 .

[12]  Éva Tardos,et al.  Approximation algorithms for classification problems with pairwise relationships: metric labeling and Markov random fields , 1999, 40th Annual Symposium on Foundations of Computer Science (Cat. No.99CB37039).

[13]  Donald K. Friesen,et al.  Tighter Bounds for LPT Scheduling on Uniform Processors , 1987, SIAM J. Comput..

[14]  J. Matousek,et al.  Bi-Lipschitz embeddings into low-dimensional Euclidean spaces , 1990 .

[15]  Ran Raz,et al.  Lower Bounds on the Distortion of Embedding Finite Metric Spaces in Graphs , 1998, Discret. Comput. Geom..

[16]  René Sitters,et al.  The Minimum Latency Problem Is NP-Hard for Weighted Trees , 2002, IPCO.

[17]  Shui Lam,et al.  A Level Algorithm for Preemptive Scheduling , 1977, J. ACM.

[18]  Satish Rao,et al.  New approximation techniques for some ordering problems , 1998, SODA '98.

[19]  Boaz Patt-Shamir,et al.  Buffer Overflow Management in QoS Switches , 2004, SIAM J. Comput..

[20]  Jiri Matousek,et al.  Lectures on discrete geometry , 2002, Graduate texts in mathematics.

[21]  Joseph Y.-T. Leung,et al.  Minimizing Total Tardiness on One Machine is NP-Hard , 1990, Math. Oper. Res..

[22]  Frank Thomson Leighton,et al.  An approximate max-flow min-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms , 1988, [Proceedings 1988] 29th Annual Symposium on Foundations of Computer Science.

[23]  R. Ravi,et al.  A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees , 1992, J. Algorithms.

[24]  Gerhard J. Woeginger,et al.  Minimizing Makespan and Preemption Costs on a System of Uniform Machines , 2005, Algorithmica.

[25]  C. Tricot.  Two definitions of fractional dimension , 1982, Mathematical Proceedings of the Cambridge Philosophical Society.