The following pages link to Dimitris Fotakis (Q334932):
Displaying 50 items.
- Strategyproof facility location for concave cost functions (Q334934) (← links)
- On the hardness of network design for bottleneck routing games (Q389953) (← links)
- A new multi-objective self-organizing optimization algorithm (MOSOA) for spatial optimization problems (Q426543) (← links)
- Efficient methods for selfish network design (Q442104) (← links)
- Combined land-use and water allocation planning (Q475225) (← links)
- Efficient money burning in general domains (Q506525) (← links)
- Combinatorial auctions without money (Q521808) (← links)
- The impact of social ignorance on weighted congestion games (Q692896) (← links)
- Scheduling MapReduce jobs on identical and unrelated processors (Q778521) (← 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)
- A primal-dual algorithm for online non-uniform facility location (Q924552) (← links)
- Stackelberg strategies for atomic congestion games (Q987387) (← links)
- Atomic congestion games: fast, myopic and concurrent (Q987399) (← links)
- Congestion games with linearly independent paths: convergence time and price of anarchy (Q987402) (← links)
- (Q1348939) (redirect page) (← links)
- Minimum congestion redundant assignments to tolerate random faults (Q1348940) (← links)
- (Q1693211) (redirect page) (← links)
- Scheduling MapReduce jobs under multi-round precedences (Q1693215) (← links)
- Space efficient hash tables with worst case constant access time (Q1771320) (← links)
- Winner-imposing strategyproof mechanisms for multiple facility location games (Q1939256) (← links)
- Escaping Braess's paradox through approximate Caratheodory's theorem (Q2094366) (← links)
- Asymptotically optimal communication in simple mechanisms (Q2109943) (← links)
- Memoryless algorithms for the generalized k-server problem on uniform metrics (Q2117695) (← links)
- Strategyproof facility location in perturbation stable instances (Q2152106) (← links)
- Efficient parameter estimation of truncated Boolean product distributions (Q2161002) (← links)
- A constant-factor approximation for generalized malleable scheduling under \(M^\natural \)-concave processing speeds (Q2164700) (← links)
- Opinion dynamics with limited information (Q2190406) (← links)
- Reallocating multiple facilities on the line (Q2222090) (← links)
- Improving selfish routing for risk-averse players (Q2300632) (← links)
- Resolving Braess's paradox in random networks (Q2408090) (← links)
- On the efficiency of influence-and-exploit strategies for revenue maximization under positive externalities (Q2453122) (← links)
- Online sum-radii clustering (Q2453160) (← links)
- On the competitive ratio for online facility location (Q2471804) (← links)
- Incremental algorithms for facility location and \(k\)-median (Q2503354) (← links)
- Radiocoloring in planar graphs: Complexity and approximations (Q2566036) (← links)
- Selfish unsplittable flows (Q2581267) (← links)
- Metric-distortion bounds under limited information (Q2670934) (← links)
- (Q2770494) (← links)
- Stochastic Congestion Games with Risk-Averse Players (Q2856134) (← links)
- Online Sum-Radii Clustering (Q2912738) (← links)
- Resolving Braess’s Paradox in Random Networks (Q2937757) (← links)
- Truthfulness Flooded Domains and the Power of Verification for Mechanism Design (Q2937758) (← links)
- Influence Maximization in Switching-Selection Threshold Models (Q2938652) (← links)
- Conference Program Design with Single-Peaked and Single-Crossing Preferences (Q2959832) (← links)
- Selfish Transportation Games (Q2971133) (← links)
- Externalities among Advertisers in Sponsored Search (Q3095263) (← links)
- (Q3152424) (← links)
- On the Existence of Optimal Taxes for Network Congestion Games with Heterogeneous Users (Q3162516) (← links)
- Memoryless facility location in one pass (Q3189034) (← links)
