The following pages link to Marios Mavronicolas (Q235719):
Displaying 50 items.
- The complexity of equilibria for risk-modeling valuations (Q284585) (← links)
- Impossibility results for weak threshold networks (Q287142) (← links)
- The complexity of pure equilibria in mix-weighted congestion games on parallel links (Q495670) (← links)
- The impact of network structure on the stability of greedy protocols (Q814919) (← links)
- The structure and complexity of Nash equilibria for a selfish routing game (Q838143) (← links)
- The price of anarchy for polynomial social cost (Q861255) (← links)
- Performance and stability bounds for dynamic networks (Q878681) (← links)
- Minimizing expectation plus variance (Q904686) (← links)
- A network game with attackers and a defender (Q930603) (← links)
- Cost sharing mechanisms for fair pricing of resource usage (Q943873) (← links)
- A new model for selfish routing (Q952441) (← links)
- Nash equilibria in discrete routing games with convex latency functions (Q955351) (← links)
- An efficient counting network (Q986532) (← links)
- Facets of the fully mixed Nash equilibrium conjecture (Q987401) (← links)
- The increase of the instability of networks due to quasi-static link capacities (Q995558) (← links)
- The price of selfish routing (Q996709) (← links)
- Computing on a partially eponymous ring (Q1004322) (← links)
- A substitution theorem for graceful trees and its applications (Q1043540) (← links)
- Efficiency of semi-synchronous versus asynchronous systems: Atomic shared memory (Q1203715) (← links)
- Linearizable read/write objects (Q1292436) (← links)
- A \(q\)-analog of approximation inclusion-exclusion (Q1383437) (← links)
- Complexity of rational and irrational Nash equilibria (Q1678771) (← links)
- Approximate equilibria and ball fusion (Q1762998) (← links)
- The cost of concurrent, low-contention Read \& Modify \& Write (Q1770373) (← links)
- Trade-off results for connection management (Q1853581) (← links)
- The complexity of \((\mathsf{E}+\mathsf{Var})\)-equilibria, \(\mathsf{ESR}\)-equilibria, and \(\mathsf{SuperE}\)-equilibria for 2-players games with few cost values (Q1998841) (← links)
- (In)existence of equilibria for 2-player, 2-value games with semistrictly quasiconcave cost functions (Q2082560) (← links)
- Direct routing: Algorithms and complexity (Q2369874) (← links)
- How many attackers can selfish defenders catch? (Q2444551) (← links)
- Efficient bufferless packet switching on trees and leveled networks (Q2455398) (← links)
- Structure and complexity of extreme Nash equilibria (Q2570130) (← links)
- The complexity of computational problems about Nash equilibria in symmetric win-lose games (Q2659767) (← links)
- The price of defense (Q2663706) (← links)
- (Q2709236) (← links)
- (Q2729238) (← links)
- (Q2743686) (← links)
- Contention in balancing networks resolved (extended abstract) (Q2790101) (← links)
- Complexity of Rational and Irrational Nash Equilibria (Q3095274) (← links)
- (Q3396550) (← links)
- Weighted Boolean Formula Games (Q3464467) (← links)
- Universal Bufferless Packet Switching (Q3519391) (← links)
- Congestion Games with Player-Specific Constants (Q3525607) (← links)
- (Q3568105) (← links)
- Voronoi Games on Cycle Graphs (Q3599153) (← links)
- (Q4232887) (← links)
- (Q4250787) (← links)
- Efficiency of semisynchronous versus asynchronous networks (Q4311637) (← links)
- A combinatorial treatment of balancing networks (Q4371688) (← links)
- (Q4437116) (← links)
- (Q4437513) (← links)
