EURO-Online login
- New to EURO? Create an account
- I forgot my username and/or my password.
- Help with cookies
(important for IE8 users)
1582. Optimization and allocation for connection scheduling problems
Invited abstract in session MD-36: Game Theory, Solutions and Structures IV, stream Game Theory, Solutions and Structures.
Monday, 14:30-16:00Room: 32 (building: 306)
Authors (first author is the speaker)
| 1. | Laura Davila-Pena
|
| Department of Analytics, Operations and Systems, Kent Business School, University of Kent | |
| 2. | Peter Borm
|
| Tilburg University | |
| 3. | Ignacio García-Jurado
|
| Department of Mathematics, Coruna University | |
| 4. | Jop Schouten
|
| Econometrics and Operations Research, Tilburg University |
Abstract
This work analyzes so-called connection scheduling problems (CSPs), a type of interactive Operations Research problem that combines elements from minimum cost spanning tree problems and sequencing problems. Given a graph, our goal is twofold: firstly, to establish an optimal connection order among players to minimize the overall cost of connecting them to a source, and secondly, to develop a cost allocation strategy for this optimal order among the involved players. We focus specifically on CSPs on trees, for which we propose a recursive solving method integrated with an allocation approach.
Keywords
- Scheduling
- Graphs and Networks
- Game Theory
Status: accepted
Back to the list of papers