Publication

Liberalization and Competition in Postal Markets: Decentralized Infrastructure versus Cherry Picking

Related publications (157)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Epitome - A Social Game for Photo Album Summarization

Touradj Ebrahimi, Jong Seok Lee, Ivan Ivanov, Péter Vajda

In this paper, we propose an approach for photo album summarization through a novel social game "Epitome" for mobile phones. Our approach to album summarization consists of two games: "Select the Best!" and "Split it!". The goal of the first game is to all ...

2010

A Systemic Approach for Modeling and Analysis of Coopetition

Alain Wegmann, Arash Golnam, Ron Sanchez

Coopetition has been defined as an approach to managing that combines competition and cooperation. Coopetition transcends the traditional paradigms of competition and cooperation in an effort to achieve the advantages of both. As an inter-organizational re ...

EIASM2010

Alumni Profiles

Former PhD students, post-docs and junior researchers of the Section de chimie et biochimie now holding positions at different universities and private companies remember the time they spent in Geneva and give an account of how this has set off and influen ...

2009

A Topological Treatment of Early-Deciding Set-Agreement

Rachid Guerraoui, Bastian Pochon

The k-set-agreement problem consists for a set of n processes to agree on less than k among n possibly different Values, each initially known to only one process. The problem is at the heart of distributed computing and generalizes the celebrated consensus ...

2009

Structural identification to improve bridge management

Ian Smith, James-Alexandre Goulet

This paper presents results from static loads tests performed on the new Langensand Bridge built in Switzerland. A systematic study of over 1000 models subjected to three load cases identifies a set of 11 candidate models through static measurements. Predi ...

International Association for Bridge and Structural Engineering2009

Through thickness air permeability of prepregs during cure

Véronique Michaud, Sandra Sequeira Lopes Tavares

An experimental method based on a falling pressure measurement is proposed to evaluate the through thickness air permeability of prepregs during cure, with two set-up variants. One concerns the measurement of the inherent air permeability and the other app ...

2009

Network coding for undirected information exchange

Christina Fragouli, Suhas Diggavi

We consider the information exchange problem where each in a set of terminals transmits information to all other terminals in the set, over an undirected network. We show that the design of only a single network code for multicasting is sufficient to achie ...

2009

A Pricing Algorithm for the Vehicle Routing Problem with Soft Time Windows

Matteo Salani

The Vehicle Routing Problem with Soft Time Windows consists in computing a minimum cost set of routes for a fleet of vehicles of limited capacity that must visit a given set of customers with known demand, with the additional feature that each customer exp ...

2009

A property of Bp(G). Applications to convolution operators

Antoine Derighetti

A new property of B-p(G), permits to obtain an approximation theorem for p-convolution operators and a non-commutative version of the Lohoues monomorphism theorem concerning the norm closure of the set of all p-convolution operators with compact support. ( ...

2009

The Vehicle Routing Problem with Discrete Split Delivery and Time Windows

Matteo Salani, Ilaria Vacca

The Discrete Split Delivery Vehicle Routing Problem with Time Windows (DSDVRPTW) consists of designing the optimal set of routes to serve, at least cost, a given set of customers while respecting constraints on vehicles capacity and customer time windows. ...

2009