The random-order interpretation of the Shapley value specifies both a terminal allocation and a payment path: each entrant is paid her marginal contribution at the time of entry. We embed this path in a finite dynamic entry problem in which a selected player may accept immediately or defer and allow another outsider to enter first. A flow is fully voluntary when immediate acceptance is optimal at every decision state. Although this criterion is defined through optimal continuation values, backward induction yields an equivalent system of linear inequalities in full-consent continuation values. The distinction between allocation and path is sharp in convex games: the Shapley allocation lies in the core, but the Shapley flow is fully voluntary only in additive games. Nevertheless, every efficient allocation admits a budget-balanced fully voluntary implementation when signed payments are available. We select a canonical implementation by minimizing distance from the Shapley flow, derive a reduced quadratic program for symmetric cardinality games, and study equal residual sharing, which selects the terminal allocation endogenously. With two player types, the selected allocation is an affine combination of the Shapley and equal-division allocations. Examples illustrate the effects of payment restrictions and a possible conflict between full voluntariness and coalitional stability.
Understanding when fair allocation mechanisms lead to stable coalition structures is fundamental for designing robust multi-agent systems. We investigate the compatibility between stable allocations in transferable utility (TU) games and the stability of coalition structures in induced hedonic games, where agents' pref...
Ayşe Mutlu Derya· Proceedings of the Thirty-Fi...· 0 citations
Global games select a unique cutoff when a player's incentive moves monotonically with private information. We show that this logic can fail when a privately informed participant can take a costly, simultaneous, and unobserved action that defends the status quo. In a currency-attack model, the defender acts only at int...
We study repeated contract design when a principal observes outcomes but not the actions that generate them. The principal may use any bounded outcome-contingent payment vector, and the agent's best response can make expected profit discontinuous in those payments. For every fixed number $m\ge2$ of outcomes, the minima...
When auction bidders misperceive their rivals, a seller can change not only the amount of information rent but also the states in which it is delivered. We ask when this payment-design opportunity survives a finite bidding interface, nonnegative-payment restrictions, and comparison with conventional auctions under the...
We revisit reconfiguration in the fair allocation of indivisible goods, where the goal is to transform one fair allocation into another through a sequence of exchanges while preserving fairness at every step. Our focus is on the hierarchy of envy-freeness up to $k$ goods (EF$k$). We show that for any fixed $k$, two EF1...
Three-player Auction Bridge is a finite imperfect-information game in which dynamic partnerships create a distinctive interaction between scoring, strategic incentives, and payoff distribution. This paper develops a unified statistical and game-theoretic framework to evaluate a traditional scoring rule against a modifi...
Aritrabha Majumdar, S. Sarkar, Moutushi Chatterjee· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.