The following pages link to Dimitris Fotakis (Q334932):
Displaying 50 items.
- (Q3433948) (← links)
- Efficient Money Burning in General Domains (Q3449584) (← links)
- Improving Selfish Routing for Risk-Averse Players (Q3460799) (← links)
- A Glimpse at Paul G. Spirakis (Q3464465) (← links)
- On Radiocoloring Hierarchically Specified Planar Graphs: $$\mathcal{PSPACE}$$ -completeness and Approximations (Q3464470) (← links)
- A Selective Tour Through Congestion Games (Q3464474) (← links)
- Stackelberg Strategies for Atomic Congestion Games (Q3527221) (← links)
- Cost-Balancing Tolls for Atomic Network Congestion Games (Q3574300) (← links)
- Atomic Congestion Games Among Coalitions (Q3613791) (← links)
- (Q4232883) (← links)
- (Q4247263) (← links)
- (Q4375813) (← links)
- (Q4414500) (← links)
- (Q4418656) (← links)
- (Q4449209) (← links)
- (Q4527190) (← links)
- (Q4536372) (← links)
- (Q4550766) (← links)
- The Power of Verification for Greedy Mechanism Design (Q4580271) (← links)
- Efficient lineage for SUM aggregate queries (Q4589119) (← links)
- On the Size and the Approximability of Minimum Temporally Connected Subgraphs (Q4598293) (← links)
- Sub-exponential Approximation Schemes for CSPs: From Dense to Almost Sparse (Q4601889) (← links)
- (Q4708560) (← links)
- (Q4737150) (← links)
- (Q4791664) (← links)
- On the Hardness of Network Design for Bottleneck Routing Games (Q4910942) (← links)
- Atomic congestion games among coalitions (Q4962757) (← links)
- (Q4999211) (← links)
- (Q5091070) (← links)
- Metric-Distortion Bounds under Limited Information (Q5094078) (← links)
- Stathis Zachos at 70! (Q5283390) (← links)
- Efficient Methods for Selfish Network Design (Q5321677) (← links)
- On the Power of Deterministic Mechanisms for Facility Location Games (Q5326582) (← links)
- Memoryless Facility Location in One Pass (Q5449835) (← links)
- Congestion Games with Linearly Independent Paths: Convergence Time and Price of Anarchy (Q5459970) (← links)
- Atomic Congestion Games: Fast, Myopic and Concurrent (Q5459977) (← links)
- Algorithms – ESA 2004 (Q5464593) (← links)
- Automata, Languages and Programming (Q5466497) (← links)
- (Q5875469) (← links)
- Opinion formation games with aggregation and negative influence (Q5894696) (← links)
- Approximation and Online Algorithms (Q5898471) (← links)
- Mechanism design for perturbation stable combinatorial auctions (Q5918584) (← links)
- Mechanism design for perturbation stable combinatorial auctions (Q5918751) (← links)
- Opinion formation games with aggregation and negative influence (Q5919608) (← links)
- Opinion dynamics with limited information (Q6088303) (← links)
- Malleable scheduling beyond identical machines (Q6090217) (← links)
- Malleable scheduling beyond identical machines (Q6316221) (← links)
- Efficient Parameter Estimation of Truncated Boolean Product Distributions (Q6344445) (← links)
- A constant-factor approximation for generalized malleable scheduling under \(M^{\natural }\)-concave processing speeds (Q6589760) (← links)
- Graph connectivity with noisy queries (Q6647680) (← links)
