Zobrazeno 1 - 10
of 173
pro vyhledávání: '"Kawase, Yasushi"'
Autor:
Kawase, Yasushi, Nakayoshi, Tomohiro
In this paper, we introduce the problem of Online Matching with Delays and Size-based Costs (OMDSC). The OMDSC problem involves $m$ requests arriving online. At any time, a group can be formed by matching any number of these requests that have been r
Externí odkaz:
http://arxiv.org/abs/2408.08658
We study the problem of allocating indivisible items on a path among agents. The objective is to find a fair and efficient allocation in which each agent's bundle forms a contiguous block on the line. We demonstrate that, even when the valuations are
Externí odkaz:
http://arxiv.org/abs/2401.04318
We study the fair division of indivisible items with subsidies among $n$ agents, where the absolute marginal valuation of each item is at most one. Under monotone valuations (where each item is a good), Brustle et al. (2020) demonstrated that a maxim
Externí odkaz:
http://arxiv.org/abs/2308.11230
Autor:
Yoshinaga, Toru, Kawase, Yasushi
The last success problem is an optimal stopping problem that aims to maximize the probability of stopping on the last success in a sequence of independent $n$ Bernoulli trials. In the classical setting where complete information about the distributio
Externí odkaz:
http://arxiv.org/abs/2308.09356
Publikováno v:
Proceedings of the 51st International Colloquium on Automata, Languages, and Programming (ICALP 2024), pp. 96:1-96:19, 2024
The fair allocation of mixed goods, consisting of both divisible and indivisible goods, has been a prominent topic of study in economics and computer science. We define an allocation as fair if its utility vector minimizes a symmetric strictly convex
Externí odkaz:
http://arxiv.org/abs/2306.05986
Autor:
Yoshinaga, Toru, Kawase, Yasushi
Online contention resolution schemes (OCRSs) are effective rounding techniques for online stochastic combinatorial optimization problems. These schemes randomly and sequentially round a fractional solution to a relaxed problem that can be formulated
Externí odkaz:
http://arxiv.org/abs/2305.08622
Network analysis has played a key role in knowledge discovery and data mining. In many real-world applications in recent years, we are interested in mining multilayer networks, where we have a number of edge sets called layers, which encode different
Externí odkaz:
http://arxiv.org/abs/2211.03306
A lottery is a popular form of gambling between a seller and multiple buyers, and its profitable design is of primary interest to the seller. Designing a lottery requires modeling the buyer decision-making process for uncertain outcomes. One of the m
Externí odkaz:
http://arxiv.org/abs/2209.00822
We consider the problem of random assignment of indivisible goods, in which each agent has an ordinal preference and a constraint. Our goal is to characterize the conditions under which there exists a random assignment that simultaneously achieves ef
Externí odkaz:
http://arxiv.org/abs/2208.07666
Publikováno v:
Games and Economic Behavior, 147:268-287 (2024)
We study a fair division setting in which participants are to be fairly distributed among teams, where not only do the teams have preferences over the participants as in the canonical fair division setting, but the participants also have preferences
Externí odkaz:
http://arxiv.org/abs/2206.05879