Zobrazeno 1 - 10
of 63
pro vyhledávání: '"Atay, Ata"'
This paper studies many-to-one assignment markets, or matching markets with wages. Although it is well-known that the core of this model is non-empty, the structure of the core has not been fully investigated. To the known dissimilarities with the on
Externí odkaz:
http://arxiv.org/abs/2404.04847
Autor:
Atay, Ata, Trudeau, Christian
Cooperative game theory aims to study how to divide a joint value created by a set of players. These games are often studied through the characteristic function form with transferable utility, which represents the value obtainable by each coalition.
Externí odkaz:
http://arxiv.org/abs/2403.01442
Autor:
Atay, Ata, Romero-Medina, Antonio
We investigate the allocation of children to childcare facilities and propose solutions to overcome limitations in the current allocation mechanism. We introduce a natural preference domain and a priority structure that address these setbacks, aiming
Externí odkaz:
http://arxiv.org/abs/2308.14689
We adopt the notion of the farsighted stable set to determine which matchings are stable when agents are farsighted in matching markets with couples. We show that a singleton matching is a farsighted stable set if and only if the matching is stable.
Externí odkaz:
http://arxiv.org/abs/2304.12276
We consider priority-based matching problems with limited farsightedness. We show that, once agents are sufficiently farsighted, the matching obtained from the Top Trading Cycles (TTC) algorithm becomes stable: a singleton set consisting of the TTC m
Externí odkaz:
http://arxiv.org/abs/2212.07427
We consider priority-based school choice problems with farsighted students. We show that a singleton set consisting of the matching obtained from the Top Trading Cycles (TTC) mechanism is a farsighted stable set. However, the matching obtained from t
Externí odkaz:
http://arxiv.org/abs/2212.07108
Autor:
Atay, Ata, Trudeau, Christian
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
Externí odkaz:
http://arxiv.org/abs/2207.07190
This paper studies matching markets in the presence of middlemen. In our framework, a buyer-seller pair may either trade directly or use the services of a middleman; and a middleman may serve multiple buyer-seller pairs. Direct trade between a buyer
Externí odkaz:
http://arxiv.org/abs/2109.05456
Autor:
Atay, Ata, Trudeau, Christian
Publikováno v:
In Games and Economic Behavior March 2024 144:104-125
This paper takes a game theoretical approach to open shop scheduling problems with unit execution times to minimize the sum of completion times. By supposing an initial schedule and associating each job (consisting in a number of operations) to a dif
Externí odkaz:
http://arxiv.org/abs/1907.12909