Concept

Marginal utility

Related publications (32)

Capturing trade-offs between daily scheduling choices

Michel Bierlaire, Timothy Michael Hillel, Janody Pougala

We propose a new modelling approach for daily activity scheduling which integrates the different daily scheduling choice dimensions (activity participation, location, schedule, duration and transportation mode) into a single optimisation problem. The funda ...

ELSEVIER SCI LTD2022

A chance-constraint approach for optimizing Social Engagement-based services

Michel Bierlaire, Edoardo Fadda

Social Engagement is a novel business model transforming final users of a service from passive into active components. In this framework, people are contacted by a company and they are asked to perform tasks in exchange for a reward. This arises the compli ...

IEEE2022

Monotonicity in the trip scheduling problem

Nikolaos Geroliminis, Raphael Ali Francis Lamotte

The equilibrium of the archetypal morning commute problem with alpha -,B - gamma preferences has been shown to be unstable with various rational adjustment mechanisms, under both continuous and discrete day-to-day dynamics. It is not clear however whether ...

PERGAMON-ELSEVIER SCIENCE LTD2021

Which professional skills do students learn in engineering team-based projects?

Jürg Alexander Schiffmann, Roland John Tormey, Cécile Hardebolle, Cyril Picard

Engineering accreditation bodies express a strong consensus that in addition to technical and scientific skills, engineering education also needs to promote the development of professional skills. In general, team-based projects are considered to be valuab ...

2021

Resolving time conflicts in activity-based scheduling

Michel Bierlaire, Timothy Michael Hillel, Janody Pougala

In this paper, we present a novel activity-based scheduling model that combines a continuous optimisation framework for temporal scheduling decisions (i.e. activity timings and durations) with traditional discrete choice models for non-temporal choice dime ...

2021

Resolving time conflicts in activity-based scheduling: A case study of Lausanne

Michel Bierlaire, Timothy Michael Hillel, Janody Pougala

2021

Bayesian Decision Making in Groups is Hard

Jan Hazla

We study the computations that Bayesian agents undertake when exchanging opinions over a network. The agents act repeatedly on their private information and take myopic actions that maximize their expected utility according to a fully rational posterior be ...

INFORMS2021

Secrecy by Design With Applications to Privacy and Compression

Yanina Yurina Shkel

Secrecy by design is examined as an approach to information-theoretic secrecy. The main idea behind this approach is to design an information processing system from the ground up to be perfectly secure with respect to an explicit secrecy constraint. The pr ...

2021

To pool or not to pool: Equilibrium, pricing and regulation

Kenan Zhang

We study a transportation network company (TNC) that offers on-demand solo and pooling e-hail services in an aggregate mobility service market, while competing with transit for passengers. The market equilibrium is established based on a spatial driver–pas ...

2021

Balancing management of strategic aggregators using non-cooperative game theory

Mokhtar Bozorg, Mohammad Rayati

The aggregators are intermediary players at the distribution system level. They manage the financial transactions of resources such as micro-turbines (MTs), photo-voltaic (PV) production systems, flexible demands (FDs), and must-run demands (MDs) in the en ...

ELSEVIER SCIENCE SA2020

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.