Coordination Mechanisms

Coordination Mechanisms

Visa andra versioner (1)

Bibliografiska uppgifter
Huvudupphovsmän:	Christodoulou, G, Koutsoupias, E, Nanavati., A
Materialtyp:	Conference item
Publicerad:	Turku‚ Finland 2015

Liknande verk

Coordination mechanisms
av: Christodoulou, G, et al.
Publicerad: (2009)

Congestion Games and Coordination Mechanisms
av: Koutsoupias, E
Publicerad: (2015)

Coordination mechanisms for congestion games.
av: Koutsoupias, E
Publicerad: (2004)

Mechanism design for scheduling
av: Christodoulou, G, et al.
Publicerad: (2009)

The online matching problem on a line
av: Koutsoupias, E, et al.
Publicerad: (2003)

A lower bound for scheduling mechanisms.
av: Christodoulou, G, et al.
Publicerad: (2015)

A Lower Bound for Scheduling Mechanisms
av: Christodoulou, G, et al.
Publicerad: (2009)

A Lower Bound for Scheduling Mechanisms
av: Christodoulou, G, et al.
Publicerad: (2009)

Mechanism Design for Fractional Scheduling on Unrelated Machines
av: Christodoulou, G, et al.
Publicerad: (2015)

A characterization of 2−player mechanisms for scheduling
av: Christodoulou, G, et al.
Publicerad: (2008)

Mechanism design for fractional scheduling on unrelated machines
av: Christodoulou, G, et al.
Publicerad: (2010)

Mechanism Design for Fractional Scheduling on Unrelated Machines
av: Christodoulou, G, et al.
Publicerad: (2010)

On the Price of Anarchy and Stability of Correlated Equilibria of Linear Congestion Games.
av: Christodoulou, G, et al.
Publicerad: (2015)

The price of anarchy of finite congestion games
av: Christodoulou, G, et al.
Publicerad: (2015)

On the Nisan-Ronen conjecture
av: Christodoulou, G, et al.
Publicerad: (2022)

Truthful allocation in graphs and hypergraphs
av: Christodoulou, G, et al.
Publicerad: (2025)

A proof of the Nisan-Ronen conjecture --- an overview
av: Christodoulou, G, et al.
Publicerad: (2024)

On the Nisan-Ronen conjecture for submodular valuations
av: Christodoulou, G, et al.
Publicerad: (2020)

Truthful allocation in graphs and hypergraphs
av: Christodoulou, G, et al.
Publicerad: (2021)

A proof of the Nisan-Ronen conjecture
av: Christodoulou, G, et al.
Publicerad: (2023)

On the Nisan-Ronen conjecture
av: Christodoulou, G, et al.
Publicerad: (2022)

On the Performance of Approximate Equilibria in Congestion Games
av: Christodoulou, G, et al.
Publicerad: (2015)

On the Performance of Approximate Equilibria in Congestion Games
av: Christodoulou, G, et al.
Publicerad: (2011)

On the Performance of Approximate Equilibria in Congestion Games
av: Christodoulou, G, et al.
Publicerad: (2011)

Fair allocation in graphs
av: Christodoulou, G, et al.
Publicerad: (2023)

Recent Developments in the Mechanism Design Problem for Scheduling
av: Koutsoupias, E
Publicerad: (2011)

A Lower Bound of 1+phi for Truthful Scheduling Mechanisms
av: Koutsoupias, E, et al.
Publicerad: (2015)

A Lower Bound of 1+φ for Truthful Scheduling Mechanisms
av: Koutsoupias, E, et al.
Publicerad: (2013)

Current concepts to reduce mechanical stiffness in locked plating systems: a review article
av: Nanavati N, et al.
Publicerad: (2014-10-01)

Approaching utopia: strong truthfulness and externality−resistant mechanisms
av: Fiat, A, et al.
Publicerad: (2013)

Mapping the coordination and cooperation mechanisms of risk communication on feed/food safety in the EU
av: IHS Markit, et al.
Publicerad: (2021-04-01)

Weak adversaries for the k−server problem
av: Koutsoupias, E
Publicerad: (2015)

Scheduling without payments
av: Koutsoupias, E
Publicerad: (2015)

The k−server problem
av: Koutsoupias, E
Publicerad: (2009)

Selfish task allocation
av: Koutsoupias, E
Publicerad: (2003)

On−line algorithms and the k−server conjecture
av: Koutsoupias, E
Publicerad: (1994)

Improvements on Khrapchenko's theorem
av: Koutsoupias, E
Publicerad: (1993)

On the Competitive Ratio of Online Sampling Auctions
av: Koutsoupias, E, et al.
Publicerad: (2013)

On the Competitive Ratio of Online Sampling Auctions
av: Koutsoupias, E, et al.
Publicerad: (2010)

Coordination mechanisms for selfish scheduling
av: Mirrokni, Vahab, et al.
Publicerad: (2010)