Concept

Linear utility

Publications associées (12)

Beyond worst-case analysis, with or without predictions

In this thesis we design online combinatorial optimization algorithms for beyond worst-case analysis settings.In the first part, we discuss the online matching problem and prove that, in the edge arrival model, no online algorithm can achieve a competitive ...

EPFL2023

Heterogeneity in decentralized asset markets

Julien Hugonnier

We study a canonical model of decentralized exchange for a durable good or asset, where agents are assumed to have time-varying, heterogeneous utility types. Whereas the existing literature has focused on the special case of two types, we allow agents' uti ...

ECONOMETRIC SOCIETY2022

Profit Optimization for Wireless Video Broadcasting Systems Based on Polymatroidal Analysis

Pascal Frossard, Yiqiang Chen

This study addresses the problem of profit maximization between wireless service providers (WSPs) and content providers (CPs) in wireless broadcasting systems, while simultaneously providing high quality of experience for end-users (EUs). We first study th ...

2015

On the configuration LP for maximum budgeted allocation

Ola Nils Anders Svensson, Christos Kalaitzis, Lukas Polacek, Aleksander Madry

We study the maximum budgeted allocation problem, i.e., the problem of selling a set of m indivisible goods to n players, each with a separate budget, such that we maximize the collected revenue. Since the natural assignment LP is known to have an integral ...

Springer Heidelberg2015

Scalable and Adaptive Online Joins

Christoph Koch, Aleksandar Vitorovic, Abdallah Alaaeldin Abdelaziz Elguindy

Scalable join processing in a parallel shared-nothing environment requires a partitioning policy that evenly distributes the processing load while minimizing the size of state maintained and number of messages communicated. Previous research proposes stati ...

VLDB2014

On the Configuration LP for Maximum Budgeted Allocation

Ola Nils Anders Svensson, Christos Kalaitzis, Lukas Polacek, Aleksander Madry

We study the Maximum Budgeted Allocation problem, i.e., the problem of selling a set of m indivisible goods to n players, each with a separate budget, such that we maximize the collected revenue. Since the natural assignment LP is known to have an integral ...

Springer2014

A Robust Meta-Game for Climate Negotiations

Marc Vielle, Frédéric Louis François Babonneau, Alain Haurie

This paper deals with an application of the robust equilibrium concept in game theory to the assessment of the possible international agreement on climate that could be achieved in the conference of the parties negotiations organized by the UNFCCC. It is s ...

Springer Verlag2013

Site-scale process integration and utility optimization with multiple representations of heating and cooling requirements: Application to an existing chemical plant

François Maréchal, Nasibeh Pouransari

This study presents a methodology based on the process integration techniques and multiple representation of heating and cooling requirement concept to improve the energy efficiency of a large-scale chemical plant. Considering the difficulties of data gath ...

2013

An Expressive Mechanism for Auctions on the Web

Monika Henzinger, Ingmar Weber, Paul David Dütting

Auctions are widely used on the Web. Applications range from internet advertising to platforms such as eBay. In most of these applications the auctions in use are single/multi-item auctions with unit demand. The main drawback of standard mechanisms for thi ...

2011

Indifference Pricing for Power Utilities

Semyon Malamud

We study utility indiﬀerence pricing of claim streams with intertem- poral consumption and power (CRRA) utilities. We derive explicit for- mulas for the derivatives of the utility indiﬀerence price with respect to claims and wealth. The simple structure of ...

2009

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search