arXiv subjects

Christian Trudeau

Publications and source records attributed to Christian Trudeau.

3 recordsLinked to original sources

arXiv2026

Endogenous shareholding auctions

We introduce endogenous shareholding auctions for production economies where a monopolist must elicit consumer demand in order to determine price and quantity. Each of these auctions has the property that the auction's profit is distributed across the monopolist and the consumers in accordance with ownership shares that are determined over the course of the auction. We characterize this class, and a larger class, on the basis of standard axioms. Finally, we investigate optimal auctions according to both prior-free domination and subjective expected welfare.

econ.TH↗

arXiv2024

Optimistic and pessimistic approaches for cooperative games

Cooperative game theory studies how to allocate the joint value generated by a set of players. These games are typically analyzed using the characteristic function form with transferable utility, which represents the value attainable by each coalition. In the presence of externalities, coalition values can be defined through various approaches, notably by trying to determine the best and worst-case scenarios. Typically, the optimistic and pessimistic perspectives offer valuable insights into strategic interactions. In many applications, these approaches correspond to the coalition either choosing first or choosing after the complement coalition. In a general framework in which the actions of a group affects the set of feasible actions for others, we explore this relationship and show that it always holds in the presence of negative externalities, but only partly with positive externalities. We then show that if choosing first/last corresponds to these extreme values, we also obtain a useful inclusion result: allocations that do not allocate more than the optimistic upper bounds also do not allocate less than the pessimistic lower bounds. Moreover, we show that when externalities are negative, it is always possible to guarantee the non-emptiness of these sets of allocations. Finally, we explore applications to illustrate how our findings provide new results and offer a means to derive results from the existing literature.

econ.TH↗

arXiv2022

Queueing games with an endogenous number of machines

This paper studies queueing problems with an endogenous number of machines with and without an initial queue, the novelty being that coalitions not only choose how to queue, but also on how many machines. For a given problem, agents can (de)activate as many machines as they want, at a cost. After minimizing the total cost (processing costs and machine costs), we use a game theoretical approach to share to proceeds of this cooperation, and study the existence of stable allocations. First, we study queueing problems with an endogenous number of machines, and examine how to share the total cost. We provide an upper bound and a lower bound on the cost of a machine to guarantee the non-emptiness of the core (the set of stable allocations). Next, we study requeueing problems with an endogenous number of machines, where there is an existing queue. We examine how to share the cost savings compared to the initial situation, when optimally requeueing/changing the number of machines. Although, in general, stable allocation may not exist, we guarantee the existence of stable allocations when all machines are considered public goods, and we start with an initial schedule that might not have the optimal number of machines, but in which agents with large waiting costs are processed first.

econ.TH↗