Marios Mavronicolas

Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

Computational Complexity of Decision Problems About Nash Equilibria in Win-Lose Multi-player Games.

[BibT_eX]

[DOI]

Kristoffer Arnsfelt Hansen

Proceedings of the Algorithmic Game Theory - 16th International Symposium, 2023

2022

(In)Existence of Equilibria for 2-Player, 2-Value Games with Semistrictly Quasiconcave Cost Functions.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2022

2021

∃ℝ-complete Decision Problems about (Symmetric) Nash Equilibria in (Symmetric) Multi-player Games.

[BibT_eX]

[DOI]

ACM Trans. Economics and Comput., 2021

The complexity of (E+Var)-equilibria, ESR-equilibria, and SuperE-equilibria for 2-players games with few cost values.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2021

The Price of Defense.

[BibT_eX]

[DOI]

Vicky Papadopoulou Lesta

Giuseppe Persiano

Algorithmica, 2021

The Complexity of Computational Problems About Nash Equilibria in Symmetric Win-Lose Games.

[BibT_eX]

[DOI]

Algorithmica, 2021

2020

Conditional Value-at-Risk: Structure and complexity of equilibria.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2020

(In)Existence of Equilibria for 2-Players, 2-Values Games with Concave Valuations.

[BibT_eX]

[DOI]

CoRR, 2020

2018

<i>NP</i> NP -Hardness of Equilibria in Case of Risk-Averse Players.

[BibT_eX]

[DOI]

Proceedings of the Adventures Between Lower Bounds and Higher Altitudes, 2018

2017

Existential-R-Complete Decision Problems about Symmetric Nash Equilibria in Symmetric Multi-Player Games.

[BibT_eX]

[DOI]

Proceedings of the 34th Symposium on Theoretical Aspects of Computer Science, 2017

2016

The complexity of equilibria for risk-modeling valuations.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2016

A Catalog of EXISTS-R-Complete Decision Problems About Nash Equilibria in Multi-Player Games.

[BibT_eX]

[DOI]

Proceedings of the 33rd Symposium on Theoretical Aspects of Computer Science, 2016

2015

Minimizing Expectation Plus Variance.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2015

The complexity of pure equilibria in mix-weighted congestion games on parallel links.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2015

Weighted Boolean Formula Games.

[BibT_eX]

[DOI]

Klaus W. Wagner

Proceedings of the Algorithms, Probability, Networks, and Games, 2015

2014

Complexity of Rational and Irrational Nash Equilibria.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2014

2013

How many attackers can selfish defenders catch?

[BibT_eX]

[DOI]

Chrysovalandis Agathangelou

Vicky Papadopoulou Lesta

Discret. Appl. Math., 2013

A distributed algorithm for gathering many fat mobile robots in the plane.

[BibT_eX]

[DOI]

Proceedings of the ACM Symposium on Principles of Distributed Computing, 2013

2012

The Complexity of Decision Problems about Nash Equilibria in Win-Lose Games.

[BibT_eX]

[DOI]

Proceedings of the Algorithmic Game Theory - 5th International Symposium, 2012

Topic 8: Distributed Systems and Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2012 Parallel Processing - 18th International Conference, 2012

2011

Preface: Algorithmic Game Theory.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2011

2010

An efficient counting network.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Computing Nash Equilibria for Scheduling on Restricted Parallel Links.

[BibT_eX]

[DOI]

Theory Comput. Syst., 2010

Facets of the Fully Mixed Nash Equilibrium Conjecture.

[BibT_eX]

[DOI]

Rainer Feldmann

Andreas Pieris

Theory Comput. Syst., 2010

Some Algorithmic Questions About Nash Equilibria.

[BibT_eX]

Bull. EATCS, 2010

The impact of randomization in smoothing networks.

[BibT_eX]

[DOI]

Thomas Sauerwald

Distributed Comput., 2010

2009

Preface.

[BibT_eX]

[DOI]

Spyros C. Kontogiannis

Theor. Comput. Sci., 2009

Computing on a partially eponymous ring.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

Preface.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2009

The structure and complexity of Nash equilibria for a selfish routing game.

[BibT_eX]

[DOI]

Dimitris Fotakis

Spyros C. Kontogiannis

Elias Koutsoupias

Theor. Comput. Sci., 2009

Review of design and analysis of randomized algorithms: introduction to design paradigms by Juraj Hromkovic (Published by Springer).

[BibT_eX]

[DOI]

SIGACT News, 2009

A substitution theorem for graceful trees and its applications.

[BibT_eX]

[DOI]

Discret. Math., 2009

A glimpse at Christos H. Papadimitriou.

[BibT_eX]

[DOI]

Comput. Sci. Rev., 2009

Nash Equilibria for Voronoi Games on Transitive Graphs.

[BibT_eX]

[DOI]

Rainer Feldmann

Proceedings of the Internet and Network Economics, 5th International Workshop, 2009

A randomized, o(log w)-depth 2 smoothing network.

[BibT_eX]

[DOI]

Thomas Sauerwald

Proceedings of the SPAA 2009: Proceedings of the 21st Annual ACM Symposium on Parallelism in Algorithms and Architectures, 2009

2008

A new model for selfish routing.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2008

Nash equilibria in discrete routing games with convex latency functions.

[BibT_eX]

[DOI]

J. Comput. Syst. Sci., 2008

A graph-theoretic network security game.

[BibT_eX]

[DOI]

Int. J. Auton. Adapt. Commun. Syst., 2008

Sequentially consistent versus linearizable counting networks.

[BibT_eX]

[DOI]

Michael Merritt

Gadi Taubenfeld

Distributed Comput., 2008

Cost Sharing Mechanisms for Fair Pricing of Resource Usage.

[BibT_eX]

[DOI]

Panagiota N. Panagopoulou

Algorithmica, 2008

A Network Game with Attackers and a Defender.

[BibT_eX]

[DOI]

Algorithmica, 2008

Voronoi Games on Cycle Graphs.

[BibT_eX]

[DOI]

Florian Schoppmann

Proceedings of the Mathematical Foundations of Computer Science 2008, 2008

2007

The increase of the instability of networks due to Quasi-Static link capacities.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2007

Universal Bufferless Packet Switching.

[BibT_eX]

[DOI]

Malik Magdon-Ismail

SIAM J. Comput., 2007

Performance and stability bounds for dynamic networks.

[BibT_eX]

[DOI]

J. Parallel Distributed Comput., 2007

Efficient bufferless packet switching on trees and leveled networks.

[BibT_eX]

[DOI]

Malik Magdon-Ismail

J. Parallel Distributed Comput., 2007

The Price of Selfish Routing.

[BibT_eX]

[DOI]

Algorithmica, 2007

Congestion Games with Player-Specific Constants.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2007, 2007

2006

The price of anarchy for polynomial social cost.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

The Price of Anarchy for Restricted Parallel Links.

[BibT_eX]

[DOI]

Parallel Process. Lett., 2006

Direct Routing: Algorithms and Complexity.

[BibT_eX]

[DOI]

Algorithmica, 2006

The Price of Defense.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

The Power of the Defender.

[BibT_eX]

[DOI]

Marina Gelastou

Proceedings of the 26th International Conference on Distributed Computing Systems Workshops (ICDCS 2006 Workshops), 2006

The Price of Defense and Fractional Matchings.

[BibT_eX]

[DOI]

Giuseppe Persiano

Proceedings of the Distributed Computing and Networking, 8th International Conference, 2006

2005

Structure and complexity of extreme Nash equilibria.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

The cost of concurrent, low-contention Read&Modify&Write.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Game Theory Meets Theoretical Computer Science.

[BibT_eX]

[DOI]

Samson Abramsky

Theor. Comput. Sci., 2005

Efficiency of Oblivious versus Nonoblivious Schedulers for Optimistic, Rate-based Flow Control.

[BibT_eX]

[DOI]

SIAM J. Comput., 2005

The Impact of Network Structure on the Stability of Greedy Protocols.

[BibT_eX]

[DOI]

Sotiris E. Nikoletseas

Theory Comput. Syst., 2005

Max-min Fair Flow Control Sensitive to Priorities.

[BibT_eX]

[DOI]

J. Interconnect. Networks, 2005

An Application of the Monotone Linearizability Lemma.

[BibT_eX]

Bull. EATCS, 2005

A Simple Graph-Theoretic Model for Selfish Restricted Scheduling.

[BibT_eX]

[DOI]

Proceedings of the Internet and Network Economics, First International Workshop, 2005

Network Game with Attacker and Protector Entities.

[BibT_eX]

[DOI]

Proceedings of the Algorithms and Computation, 16th International Symposium, 2005

Cost Sharing Mechanisms for Fair Pricing of Resources Usage.

[BibT_eX]

[DOI]

Panagiota N. Panagopoulou

Proceedings of the Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005, 2005

A Cost Mechanism for Fair Pricing of Resource Usage.

[BibT_eX]

[DOI]

Panagiota N. Panagopoulou

Proceedings of the Algorithmic Aspects of Large and Complex Networks, 4.-9. September 2005, 2005

2004

Universal Bufferless Routing.

[BibT_eX]

[DOI]

Malik Magdon-Ismail

Proceedings of the Approximation and Online Algorithms, Second International Workshop, 2004

Near-Optimal Hot-Potato Routing on Trees.

[BibT_eX]

[DOI]

Proceedings of the Euro-Par 2004 Parallel Processing, 2004

2003

Trade-off results for connection management.

[BibT_eX]

[DOI]

Nikos Papadakis

Theor. Comput. Sci., 2003

A Comparative Study Of Protocols For Efficient Data Propagation In Smart Dust Networks.

[BibT_eX]

[DOI]

Ioannis Chatzigiannakis

Tassos Dimitriou

Sotiris E. Nikoletseas

Parallel Process. Lett., 2003

Approximate Equilibria and Ball Fusion.

[BibT_eX]

[DOI]

Elias Koutsoupias

Theory Comput. Syst., 2003

FIFO is Unstable at Arbitrarily Low Rates

[BibT_eX]

[DOI]

Electron. Colloquium Comput. Complex., 2003

Instability of Networks with Quasi-Static Link Capacities.

[BibT_eX]

Proceedings of the SIROCCO 10: Proceedings of the 10th Internaltional Colloquium on Structural Information Complexity, 2003

Which Is the Worst-Case Nash Equilibrium?

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Extreme Nash Equilibria.

[BibT_eX]

[DOI]

Proceedings of the Theoretical Computer Science, 8th Italian Conference, 2003

2002

Threshold counters with increments and decrements.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Review of Introduction to Distributed Algorithms.

[BibT_eX]

[DOI]

SIGACT News, 2002

On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols.

[BibT_eX]

[DOI]

Sotiris E. Nikoletseas

Proceedings of the Distributed Computing, 16th International Conference, 2002

Distributed Systems and Algorithms.

[BibT_eX]

[DOI]

André Schiper

Proceedings of the Euro-Par 2002, 2002

2001

The Distributed Computing Column Distributed Computing Theory to Date (Part I: Models and an Example).

[BibT_eX]

Bull. EATCS, 2001

Stability in Routing: Networks and Protocols.

[BibT_eX]

Bull. EATCS, 2001

2000

Annotated Bibliography on Counting Networks.

[BibT_eX]

Bull. EATCS, 2000

A Combinatorial Characterization of Properties Preserved by Antitokens.

[BibT_eX]

Bull. EATCS, 2000

Supporting Increment and Decrement Operations in Balancing Networks.

[BibT_eX]

[DOI]

Chic. J. Theor. Comput. Sci., 2000

1999

Linearizable Read/Write Objects.

[BibT_eX]

[DOI]

Dan Roth

Theor. Comput. Sci., 1999

Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions.

[BibT_eX]

[DOI]

Maria Eleftheriou

Proceedings of the Distributed Computing, 1999

Optimal, Distributed Decision-Making: The Case of no Communication.

[BibT_eX]

[DOI]

Proceedings of the Eighteenth Annual ACM Symposium on Principles of Distributed Computing, 1999

Optimal, Distributed Decision-Making: The Case of No Communication.

[BibT_eX]

[DOI]

Stavros Georgiades

Proceedings of the Fundamentals of Computation Theory, 12th International Symposium, 1999

1998

The Global Efficiency of Distributed, Rate-Based, Flow Control Algorithms.

[BibT_eX]

Proceedings of the SIROCCO'98, 1998

Contention in Balancing Networks Resolved (Extended Abstract).

[BibT_eX]

[DOI]

Leonidas Hadjimitsis

Proceedings of the Seventeenth Annual ACM Symposium on Principles of Distributed Computing, 1998

MaxMin Fair Flow Control Sensitive to Priorities.

[BibT_eX]

Pimitris Fatourou

Proceedings of the Distributed Computing, 1998

1997

Balancing Networks: State of the Art.

[BibT_eX]

[DOI]

Inf. Sci., 1997

Impossibility Results for Weak Threshold Networks.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1997

Advances in Rate-Based Flow Control.

[BibT_eX]

Proceedings of the SIROCCO'97, 1997

Efficiency of Oblivious Versus Non-Oblivious Schedules for Optimistic, Rate-Based Flow Control (Extended Abstract).

[BibT_eX]

[DOI]

Proceedings of the Sixteenth Annual ACM Symposium on Principles of Distributed Computing, 1997

The Impact of Timing on Linearizability in Counting Networks.

[BibT_eX]

[DOI]

Marina Papatriantafilou

Philippas Tsigas

Proceedings of the 11th International Parallel Processing Symposium (IPPS '97), 1997

Timing-based connection management.

[BibT_eX]

[DOI]

Proceedings of the Networks in Distributed Computing, 1997

1996

A Combinatorial Treatment of Balancing Networks.

[BibT_eX]

[DOI]

J. ACM, 1996

Distributed, low contention task allocation.

[BibT_eX]

[DOI]

Sarantos Kapidakis

Proceedings of the Eighth IEEE Symposium on Parallel and Distributed Processing, 1996

Wait-Free Solvability Via Combinatorial Topology (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

The Strength of Counting Networks (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fifteenth Annual ACM Symposium on Principles of Distributed Computing, 1996

1995

Load Balancing Networks (Abstract).

[BibT_eX]

[DOI]

Sarantos Kapidakis

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

A Logarithmic Depth Counting Network (Abstract).

[BibT_eX]

[DOI]

Proceedings of the Fourteenth Annual ACM Symposium on Principles of Distributed Computing, 1995

1994

Efficiency of Semisynchronous Versus.

[BibT_eX]

[DOI]

Hagit Attiya

Math. Syst. Theory, 1994

The Impact of Synchronization on the Session Problem.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

Contention in Counting Networks.

[BibT_eX]

[DOI]

Nikos Hardavellas

Proceedings of the Thirteenth Annual ACM Symposium on Principles of Distributed Computing, 1994

Proving Correctness for Balancing Networks.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Parallel Processing of Discrete Optimization Problems, 1994

1993

Notes on Sorting and Counting Networks (Extended Abstract).

[BibT_eX]

[DOI]

Nikos Hardavellas

Damianos G. Karakos

Proceedings of the Distributed Algorithms, 7th International Workshop, 1993

1992

Efficient, Strongly Consistent Implementations of Shared Memory (Extended Abstract).

[BibT_eX]

[DOI]

Dan Roth

Proceedings of the Distributed Algorithms, 6th International Workshop, 1992

An upper and a lower bound for tick synchronization.

[BibT_eX]

[DOI]