Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Courbe d'indifférence

Publications associées (11)

OASIS: An integrated optimisation framework for activity scheduling

Janody Pougala

Activity-based models offer the potential for a far deeper understanding of daily mobility behaviour than trip-based models. Based on the fundamental assumption that travel demand is derived from the need to do activities, they are flexible tools that aim ...

EPFL2024

Generative AI-Enabled Conversational Interaction to Support Self-Directed Learning Experiences in Transversal Computational Thinking

Denis Gillet, Adrian Christian Holzer, Juan Carlos Farah, Abdessalam Ouaazki

As computational thinking (CT) becomes increasingly acknowledged as an important skill in education, self-directed learning (SDL) emerges as a key strategy for developing this capability. The advent of generative AI (GenAI) conversational agents has disrup ...

2024

Monopoly Pricing with Unknown Demand

Thomas Alois Weber

The optimal pricing of goods, especially when they are new and the innovating firm is a monopolist, must proceed without precise knowledge of the demand curve. This paper provides a pricing method with a relative robustness guarantee by maximizing a perfor ...

Wiley2025

Complex Daily Activities, Country-Level Diversity, and Smartphone Sensing: A Study in Denmark, Italy, Mongolia, Paraguay, and UK

Daniel Gatica-Perez, Lakmal Buddika Meegahapola

Smartphones enable understanding human behavior with activity recognition to support peoples daily lives. Prior studies focused on using inertial sensors to detect simple activities (sitting, walking, running, etc.) and were mostly conducted in homogeneous ...

Assoc Computing Machinery2023

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

The (Co)-Location Sharing Game

Jean-Pierre Hubaux, Kévin Clément Huguenin, Mathias Jacques Jean-Marc Humbert, Alexandra-Mihaela Olteanu

Most popular location-based social networks, such as Facebook and Foursquare, let their (mobile) users post location and co-location (involving other users) information. Such posts bring social benefits to the users who post them but also to their friends ...

2019

Scheduling trips through a bottleneck: monotonicity and stability

Nikolaos Geroliminis, Raphael Ali Francis Lamotte

This paper investigates the stability of departure time choice within a population of commuters that need to pass through a bottleneck of constant capacity. It is shown that the corresponding utility function is monotonic if and only if the marginal utilit ...

2019

Exploring the diversity of social preferences: Is a heterogeneous population evolutionarily stable under assortative matching?

Charles Chadi Ayoubi, Boris Thurm

Why do individuals make different decisions when confronted with similar choices? This paper investigates whether the answer lies in an evolutionary process. Our analysis builds on recent work in evolutionary game theory showing the superiority of a given ...

2018

Composable Method for Explicit Power Flow Control in Electrical Grids

Mario Paolone, Jean-Yves Le Boudec, Andrey Bernstein

A power flow control system for an interconnected power system, the interconnected power system comprising a plurality of electrical subsystems; an abstract framework configured to work as a utility maximiser under constraints (that applies to the electric ...

2016

Bidder optimal assignments for general utilities

Monika Henzinger

We study the problem of matching bidders to items where each bidder i has general, strictly monotonic utility functions u(i,j)(p(j)) expressing his utility of being matched to item j at price p(j). For this setting we prove that a bidder optimal outcome al ...

Elsevier Science Bv2013

Bidder Optimal Assignments for General Utilities

Monika Henzinger, Paul David Dütting

We study the problem of matching bidders to items where each bidder i has a general, strictly monotonic utility functions u_{i,j}(p_j) expressing her utility of being matched to item j at price p_j . For this setting we prove that a bidder optimal outcome ...

Springer2009