Abstract Peer-to-peer (P2P) ridesharing is a form of shared-use mobility that has emerged in
recent decades as a result of enabling of the sharing economy, and the advancement of new …

Matching games naturally generalize assignment games, a well-known class of cooperative
games. Interest in matching games has grown recently due to some breakthrough results …

We consider multiple partners matching games (G, b, w), where G is a graph with an integer
vertex capacity function b and an edge weighting w. If G is bipartite, these games are called …

This thesis navigates the evolving landscape of truck platooning, a transformative
technology reshaping the transportation sector. Comprising three interconnected chapters …

An edge-weighted graph G is called stable if the value of a maximum-weight matching
equals the value of a maximum-weight fractional matching. Stable graphs play an important …

An edge-weighted, vertex-capacitated graph G is called stable if the value of a maximum-
weight capacity-matching equals the value of a maximum-weight fractional capacity …

Network bargaining games form a prominent class of examples of game theory problems
defined on graphs, where vertices represent players, and edges represent their possible …

Capacitated network bargaining games are popular combinatorial games that involve the
structure of matchings in graphs. We show that it is always possible to stabilize unweighted …

In the last decade, ubiquity of the internet and proliferation of smart personal devices have
given rise to businesses that are built on the foundation of the sharing economy. The …

Combinatorial optimization is a research area at the interface between applied mathematics
and theoretical computer science. The archetypal problem in this field is finding an optimal …