- The Price of Anarchy for Polynomial Social Cost Martin Gairing
- European Union Research Project
- A Graph-Theoretic Network Security Game Marios Mavronicolas1
- Universal Bufferless Packet Switching Costas Busch
- A Simple Graph-Theoretic Model for Selfish Restricted Scheduling Robert Elsasser1
- Efficient Bufferless Packet Switching on Trees and Leveled Networks
- Int. J. Autonomous and Adaptive Communications Systems, Vol. x, No. x, xx 1 A Graph-Theoretic Network Security Game
- Nash Equilibria in Discrete Routing Games with Convex Latency Functions
- The Price of Defense and Fractional Matchings Marios Mavronicolas1
- A Combinatorial lleatment of Balancing Networks COSTAS BUSCH* MARIOS MAVRONICOLASt
- Timing-Based, Distributed Computation: Algorithms and Impossibility Results
- A simple Graph-Theoretic Model for Selfish Restricted Scheduling
- Cost Sharing Mechanisms for Fair Pricing of Resources Usage
- A Network Game with Attackers and a Defender Marios Mavronicolas
- Near-Optimal Hot-Potato Routing on Trees Costas Busch1
- Sequentially Consistent versus Linearizable Counting Marios Mavronicolas
- Distributed Computing Theory To Date (Part I: Models and an Example)
- Theoretical Computer Science 333 (2005) 373400 www.elsevier.com/locate/tcs
- Computing on a Partially Eponymous Ring Marios Mavronicolas
- Nash Equilibria in Discrete Routing Games with Convex Latency Functions
- On the Stability of Compositions of Universally Stable, Greedy Contention-Resolution Protocols
- Parallel Processing Letters fc World Scientific Publishing Company
- Nash Equilibria for Voronoi Games on Transitive Graphs Rainer Feldmann
- Which Is the Worst-Case Nash Equilibrium? Thomas Lucking1
- Impossibility Results for Weak Threshold Networks? Costas Buscha 1 and Marios Mavronicolasb 2
- A Randomized, O(log w)-Depth 2-Smoothing Network Marios Mavronicolas
- Max-Min Fair Flow Control Sensitive to Priorities Panagiota Fatourou
- A New Model for Selfish Routing Thomas Lucking1
- The Impact of Network Structure on the Stability of Greedy Protocols
- Extreme Nash Equilibria Martin Gairing1
- Stability in Routing: Networks and Protocols Marios Mavronicolas
- DOI: 10.1007/s00453-006-0056-1 Algorithmica (2007) 48: 91126
- ( 7 , 2002, 18:01) , , CY-1678, .
- (): Publications Catalogue Electronic versions for most of the publications (including submissions and work in preparation) can
- Informatics and Computer Science
- ALGORITHMIC GAME THEORY AND APPLICATIONS
- The Impact of Randomization in Smoothing Networks Marios Mavronicolas
- the Fully Mixed Nash Equilibrium Conjecture Rainer Feldmann
- Computing Nash Equilibria for Scheduling on Restricted Parallel Links
- A Substitution Theorem for Graceful Trees and its Applications
- The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
- The Increase of the Instability of Networks due to Quasi-Static Link Capacities
- Performance and Stability Bounds for Dynamic Networks
- Cost Sharing Mechanisms for Fair Pricing of Resource Usage
- Theoretical Computer Science 343 (2005) 133157 www.elsevier.com/locate/tcs
- The Impact of Network Structure on the Stability of Greedy Protocols
- EFFICIENCY OF OBLIVIOUS VERSUS NON-OBLIVIOUS SCHEDULERS FOR OPTIMISTIC, RATE-BASED FLOW CONTROL
- Trade-o Results for Connection Management Marios Mavronicolas
- A q-analog of Approximate Inclusion-Exclusion Marios Mavronicolas
- A Combinatorial Treatment of Balancing Networks Costas Busch
- Costas Buschy Department of Computer Science
- E ciency of Semi-Synchronous versus Asynchronous Networks1 Hagit Attiya2
- Elsevier Editorial System(tm) for Discrete Applied Mathematics Manuscript Draft
- A Bound on the Rounds to Reach Lattice Agreement Marios Mavronicolasa 1
- Voronoi Games on Cycle Graphs Marios Mavronicolas1, Burkhard Monien2, Vicky G. Papadopoulou1, and
- The Impact of Randomization in Smoothing Networks Marios Mavronicolas
- April 30 May 2, 2008 SAGT 2008, Paderborn, Germany 1 Facets of the
- Weighted Boolean Formula Games Marios Mavronicolas
- Congestion Games with Player-Specific Constants Marios Mavronicolas1
- Computing on a Partially Eponymous Ring Marios Mavronicolas1
- A Network Game with Attackers and a Defender: Marios Mavronicolas
- The Price of Defense Marios Mavronicolas
- The Power of the Defender M. Gelastou
- Network Game with Attacker and Protector Marios Mavronicolas1
- A Cost Mechanism for Fair Pricing of Resource Usage
- A Graph-Theoretic Network Security Game
- Monotone Operations and Monotone Groups Costas Busch
- A Comparative Study of Protocols for Efficient Data Propagation in Smart Dust Networks
- The Price of Selfish Routing [Extended Abstract]
- Linearizability in the Presence of Drifting Clocks and Under Different Delay Assumptions
- An Upper and a Lower Bound for Tick Synchronization Marios Mavronicolas
- FIFO is Unstable at Arbitrarily Low Rates Dimitrios Koukopoulos
- (): Citations Catalogue This Catalogue contains 471 selected citations to my published research work. Out of these 471
- S A G T 2009 International Symposium on Algorithmic Game Theory
- CALL FOR PAPERS 2nd International Symposium on Algorithmic Game Theory
- Approximate Equilibria and Ball Fusion Elias Koutsoupiasy Marios Mavronicolasz Paul Spirakisx
- An Efficient Counting Network Costas Busch
- SIAM J. COMPUT. c 200X Society for Industrial and Applied Mathematics Vol. 0, No. 0, pp. 000000
- E ciency of Semi-Synchronous versus Asynchronous Systems: Atomic Shared Memory
- The Power of the Defender Marina Gelastou
- The Power of the Defender Marina Gelastou
- Optimal, Distributed Decision-Making: The Case of No Communication
- Direct Routing: Algorithms and Complexity Costas Busch
- Universal Bufferless Routing Costas Busch
- Performance and Stability Bounds for Dynamic Networks Dimitrios Koukopoulos
- How Many Attackers Can Selfish Defenders Catch? Marios Mavronicolas
- The Structure and Complexity of Nash Equilibria for a Selfish Routing Game
- Threshold Counters with Increments and Decrements? Costas Buscha 1, Neophytos Demetrioub, Maurice Herlihyc and
- Sequentially Consistent versus Linearizable Counting Networks
- Facets of the Fully Mixed Nash Equilibrium Conjecture Rainer Feldmann
- An Efficient Counting Network Costas Busch
- Linearizable Read/Write Objects Marios Mavronicolasy
- Computing Nash Equilibria for Scheduling on Restricted Parallel Links
- A New Model for Selfish Routing Thomas Lucking
