Elias Koutsoupias
#42,723
Most Influential Person Now
Researcher
Elias Koutsoupias's AcademicInfluence.com Rankings
Elias Koutsoupiasmathematics Degrees
Mathematics
#3762
World Rank
#5485
Historical Rank
Game Theory
#14
World Rank
#16
Historical Rank
Measure Theory
#3082
World Rank
#3654
Historical Rank
Download Badge
Computer Science Mathematics
Elias Koutsoupias's Degrees
- Masters Mathematics University of Oxford
Why Is Elias Koutsoupias Influential?
(Suggest an Edit or Addition)According to Wikipedia, Education Elias Koutsoupias is a Greek computer scientist working in algorithmic game theory. Koutsoupias received his bachelor's degree in electrical engineering from the National Technical University of Athens and his doctorate in computer science in 1994 from the University of California, San Diego under the supervision of Christos Papadimitriou. He subsequently taught at the University of California, Los Angeles, the University of Athens, and is now a professor at the University of Oxford.
Elias Koutsoupias's Published Works
Published Works
- Worst-case Equilibria (1999) (2472)
- The price of anarchy of finite congestion games (2005) (486)
- Heuristically Optimized Trade-Offs: A New Paradigm for Power Laws in the Internet (2002) (368)
- On the k-server conjecture (1995) (310)
- The structure and complexity of Nash equilibria for a selfish routing game (2002) (277)
- Coordination mechanisms (2009) (243)
- Blockchain Mining Games (2016) (226)
- Beyond competitive analysis [on-line algorithms] (1994) (206)
- On the analysis of indexing schemes (1997) (158)
- On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games (2005) (156)
- An approximation scheme for planar graph TSP (1995) (126)
- Approximate Equilibria and Ball Fusion (2003) (123)
- Searching a Fixed Graph (1996) (104)
- A Lower Bound for Scheduling Mechanisms (2007) (97)
- The k-server problem (2009) (95)
- On the Greedy Algorithm for Satisfiability (1992) (93)
- Optimization problems in congestion control (2000) (83)
- Three-Processor Tasks Are Undecidable (1999) (73)
- Duality and optimality of auctions for uniform distributions (2014) (71)
- On a model of indexability and its bounds for range queries (2002) (70)
- On the Performance of Approximate Equilibria in Congestion Games (2008) (67)
- On the competitive ratio of the work function algorithm for the k-server problem (2000) (60)
- A Lower Bound of 1+phi for Truthful Scheduling Mechanisms (2007) (57)
- Mechanism design for fractional scheduling on unrelated machines (2007) (54)
- Scheduling Without Payments (2011) (50)
- Reward Sharing Schemes for Stake Pools (2018) (45)
- A Lower Bound of 1+φ for Truthful Scheduling Mechanisms (2013) (44)
- The Online Matching Problem on a Line (2003) (42)
- Weak adversaries for the k-server problem (1999) (40)
- The CNN problem and other k-server variants (2000) (38)
- Selling Two Goods Optimally (2015) (32)
- A characterization of 2-player mechanisms for scheduling (2008) (32)
- Competitive Analysis of Organization Networks or Multicast Acknowledgment: How Much to Wait? (2004) (30)
- Tight bounds for 2-dimensional indexing schemes (1998) (28)
- Improvements on Khrapchenko's theorem (1993) (27)
- The Online $k$-Taxi Problem. (2018) (24)
- Energy Equilibria in Proof-of-Work Mining (2019) (24)
- Competitive Implementation of Parallel Programs (1993) (23)
- Competitive analysis of maintaining frequent items of a stream (2012) (23)
- Blockchain Mining Games with Pay Forward (2019) (23)
- Competitive Analysis of Aggregate Max in Windowed Streaming (2009) (22)
- Mechanism Design for Scheduling (2009) (20)
- Approaching utopia: strong truthfulness and externality-resistant mechanisms (2012) (20)
- On the Competitive Ratio of Online Sampling Auctions (2010) (19)
- On the k-server conjecture (1994) (19)
- Towards an analysis of indexing schemes (1997) (18)
- Beyond Competitive Analysis (2020) (17)
- Beyond myopic best response (in Cournot competition) (2012) (17)
- Selfish Task Allocation (2003) (15)
- The online 𝑘-taxi problem (2018) (14)
- On the Optimal Bisection of a Polygon (1992) (13)
- 3-processor tasks are undecidable (1995) (13)
- The FedEx Problem (2016) (12)
- Contention Issues in Congestion Games (2012) (12)
- More on randomized on-line algorithms for caching (2003) (10)
- Wealth Inequality and the Price of Anarchy (2018) (10)
- Fairness and Efficiency in DAG-based Cryptocurrencies (2019) (10)
- Online Market Intermediation (2017) (9)
- Combinatorial optimization in congestion control (2000) (9)
- The Anarchy of Scheduling Without Money (2016) (9)
- Coordination mechanisms for congestion games (2004) (9)
- On-line algorithms and the K-server conjecture (1995) (9)
- Selfish Load Balancing Under Partial Knowledge (2007) (9)
- On the Nisan-Ronen conjecture (2020) (8)
- The Infinite Server Problem (2017) (8)
- On the Nisan-Ronen conjecture for submodular valuations (2019) (7)
- Revenue Maximization for Market Intermediation with Correlated Priors (2016) (7)
- Near-optimal multi-unit auctions with ordered bidders (2012) (6)
- Online Trading as a Secretary Problem (2018) (5)
- 3-Processor Tasks Are Undecidable (Abstract). (1995) (5)
- Towards the k-server conjecture: A unifying potential, pushing the frontier to the circle (2021) (5)
- Experiments with an Economic Model of the Worldwide Web (2005) (4)
- An economic model of the worldwide web (2005) (4)
- Better Bounds for Online Line Chasing (2018) (3)
- Internet and network economics : 7th International Workshop, WINE 2011, Singapore, December 11-14, 2011: proceedings (2011) (3)
- Indexing schemes for random points (1999) (2)
- Congestion Games and Coordination Mechanisms (2004) (2)
- Prior-free multi-unit auctions with ordered bidders (2020) (2)
- Coordination mechanisms and online matching (2004) (2)
- A Lower Bound of 1+φ for Truthful Scheduling Mechanisms (2012) (2)
- Towards a theory of indexability (1997) (2)
- Truthful allocation in graphs and hypergraphs (2021) (2)
- On the optimal bisection of a polygon (extended abstract) (1990) (1)
- Incentives Against Power Grabs or How to Engineer the Revolution in a Pooled Proof of Stake System (2021) (1)
- A proof of the Nisan-Ronen conjecture (2023) (1)
- Proceedings of the 7th international conference on Internet and Network Economics (2011) (0)
- Competitive Analysis of Organization Networks or Multicast Acknowledgment: How Much to Wait? (2011) (0)
- Explorer Piecewise Boolean Algebras and Their Domains (2014) (0)
- Recent Developments in the Mechanism Design Problem for Scheduling (2011) (0)
- Carpooling in Social Networks (2016) (0)
- Simple , optimal and efficient auctions (2011) (0)
- 31 : 2 Wealth Inequality and the Price of Anarchy (2019) (0)
- The Stru ture and Complexity of NashEquilibria for a Sel sh Routing Game ? (2002) (0)
- Edinburgh Research Explorer Blockchain Mining Games (2018) (0)
- Algorithmic Game Theory - Third International Symposium, SAGT 2010, Athens, Greece, October 18-20, 2010. Proceedings (2010) (0)
- Competitive Implementation of Parallel Programs1 (0)
- Proceedings of the Third international conference on Algorithmic game theory (2010) (0)
- Duality Theory for Optimal Multidimensional Auctions (2014) (0)
- Prior-Free Auctions of Digital Goods (2013) (0)
- Preface to Special Issue on Algorithmic Game Theory (2013) (0)
- Scheduling Without Payments (2013) (0)
- Preface to Special Issue on Algorithmic Game Theory (2013) (0)
- Explorer Blockchain Mining Games (2017) (0)
- Tiered Mechanisms for Blockchain Transaction Fees (2023) (0)
- The FedEx Problem ( Working Paper ) (2016) (0)
- Internet and Network Economics (2011) (0)
- Duality theory for optimal mechanism design (2015) (0)
This paper list is powered by the following services:
Other Resources About Elias Koutsoupias
What Schools Are Affiliated With Elias Koutsoupias?
Elias Koutsoupias is affiliated with the following schools: