Page 1

Displaying 1 – 13 of 13

Showing per page

A continuous optimization model for a joint problem of pricing and resource allocation

Mustapha Bouhtou, Guillaume Erbs (2009)

RAIRO - Operations Research

This paper investigates the problem of maximizing the revenue of a telecommunications operator by simultaneously pricing point-to-point services and allocating bandwidth in its network, while facing competition. Customers are distributed into market segments, i.e., groups of customers with a similar preference for the services. This preference is expressed using utility functions, and customers choose between the offers of the operator and of the competition according to their utility. We model...

Allocating servers to facilities, when demand is elastic to travel and waiting times

Vladimir Marianov, Miguel Rios, Francisco Javier Barros (2005)

RAIRO - Operations Research - Recherche Opérationnelle

Public inoculation centers are examples of facilities providing service to customers whose demand is elastic to travel and waiting time. That is, people will not travel too far, or stay in line for too long to obtain the service. The goal, when planning such services, is to maximize the demand they attract, by locating centers and staffing them so as to reduce customers’ travel time and time spent in queue. In the case of inoculation centers, the goal is to maximize the people that travel to the...

Allocating servers to facilities, when demand is elastic to travel and waiting times

Vladimir Marianov, Miguel Rios, Francisco Javier Barros (2006)

RAIRO - Operations Research

Public inoculation centers are examples of facilities providing service to customers whose demand is elastic to travel and waiting time. That is, people will not travel too far, or stay in line for too long to obtain the service. The goal, when planning such services, is to maximize the demand they attract, by locating centers and staffing them so as to reduce customers' travel time and time spent in queue. In the case of inoculation centers, the goal is to maximize the people that travel to the...

An existence result on partitioning of a measurable space: Pareto optimality and core

Nobusumi Sagara (2006)

Kybernetika

This paper investigates the problem of optimal partitioning of a measurable space among a finite number of individuals. We demonstrate the sufficient conditions for the existence of weakly Pareto optimal partitions and for the equivalence between weak Pareto optimality and Pareto optimality. We demonstrate that every weakly Pareto optimal partition is a solution to the problem of maximizing a weighted sum of individual utilities. We also provide sufficient conditions for the existence of core partitions...

Asignación de recursos Max-Min: propiedades y algoritmos.

Amparo Mármol Conde, Blas Pelegrín Pelegrín (1991)

Trabajos de Investigación Operativa

Este trabajo trata el problema de asignación de recursos cuando el objetivo es maximizar la mínima recompensa y las funciones recompensa son continuas y estrictamente crecientes. Se estudian diferentes propiedades que conducen a algoritmos que permiten de forma eficiente la resolución de gran variedad de problemas de esta naturaleza, tanto con variables continuas como discretas.

Fast computation of the leastcore and prenucleolus of cooperative games

Joseph Frédéric Bonnans, Matthieu André (2008)

RAIRO - Operations Research

The computation of leastcore and prenucleolus is an efficient way of allocating a common resource among n players. It has, however, the drawback being a linear programming problem with 2n - 2 constraints. In this paper we show how, in the case of convex production games, generate constraints by solving small size linear programming problems, with both continuous and integer variables. The approach is extended to games with symmetries (identical players), and to games with partially continuous...

Optimal risk sharing as a cooperative game

Łukasz Kuciński (2011)

Applicationes Mathematicae

The problem of choosing an optimal insurance policy for an individual has recently been better understood, particularly due to the papers by Gajek and Zagrodny. In this paper we study its multi-agent version: we assume that insureds cooperate with one another to maximize their utility function. They create coalitions by bringing their risks to the pool and purchasing a common insurance contract. The resulting outcome is divided according to a certain rule called strategy. We address the fundamental...

Serial cost sharing

Elena Yanovskaya (2006)

Banach Center Publications

A new axiomatization of the serial method for heterogeneous cost sharing problems is given. One of the axioms is common ordinality. It requires invariance of the method w.r.t. common ordinal transformations of individual utilities.

Currently displaying 1 – 13 of 13

Page 1