Sciweavers

MST
2010
78views more  MST 2010»
13 years 3 months ago
Sensitivity of Wardrop Equilibria
We study the sensitivity of equilibria in the well-known game theoretic traffic model due to Wardrop. We mostly consider single-commodity networks. Suppose, given a unit demand fl...
Matthias Englert, Thomas Franke, Lars Olbrich
MST
2010
93views more  MST 2010»
13 years 3 months ago
Atomic Congestion Games: Fast, Myopic and Concurrent
We study here the effect of concurrent greedy moves of players in atomic congestion games where n selfish agents (players) wish to select a resource each (out of m resources) so ...
Dimitris Fotakis, Alexis C. Kaporis, Paul G. Spira...
MST
2010
98views more  MST 2010»
13 years 3 months ago
Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy
Abstract. We investigate the effect of linear independence in the strategies of congestion games on the convergence time of best improvement sequences and on the pure Price of Anar...
Dimitris Fotakis
MST
2010
103views more  MST 2010»
13 years 3 months ago
Border Correlations of Partial Words
Partial words are finite sequences over a finite alphabet A that may contain a number of “do not know” symbols denoted by ’s. Setting A = A ∪ { }, A∗ denotes the set o...
Francine Blanchet-Sadri, E. Clader, O. Simpson
MST
2010
92views more  MST 2010»
13 years 3 months ago
Bijective Linear Time Coding and Decoding for k-Trees
Saverio Caminiti, Emanuele G. Fusco, Rossella Petr...
MST
2010
83views more  MST 2010»
13 years 3 months ago
Does the Polynomial Hierarchy Collapse if Onto Functions are Invertible?
The class TFNP, defined by Megiddo and Papadimitriou, consists of multivalued functions with values that are polynomially verifiable and guaranteed to exist. Do we have evidence ...
Harry Buhrman, Lance Fortnow, Michal Koucký...
MST
2010
140views more  MST 2010»
13 years 3 months ago
Approximability of Clausal Constraints
We study a family of problems, called Maximum Solution (Max Sol), where the objective is to maximise a linear goal function over the feasible integer assignments to a set of variab...
Peter Jonsson, Gustav Nordh
MST
2010
98views more  MST 2010»
13 years 3 months ago
Why Almost All k-Colorable Graphs Are Easy to Color
Coloring a k-colorable graph using k colors (k ≥ 3) is a notoriously hard problem. Considering average case analysis allows for better results. In this work we consider the unif...
Amin Coja-Oghlan, Michael Krivelevich, Dan Vilench...
MST
2010
79views more  MST 2010»
13 years 3 months ago
A Search Algorithm for Subshift Attractors of Cellular Automata
Abstract. We describe a heuristic algorithm which searches for spreading clopen sets of a cellular automaton. Then the algorithms searches for the corresponding subshift attractors...
Enrico Formenti, Petr Kurka, Ondrej Zahradní...