13 citations · 29 across the 16 of their papers we have counts for
18 papers
Stress-Relief Annealing: Polynomial-Time Simulation-Free Layout Optimization for Automated Warehouses
Xiangjie Luo, Yulun Zhang, Miyuki Koshimura +2
We study the problem of optimizing physical layouts for automated warehouses, where hundreds to thousands of robots are coordinated to transport packages. Previous works have shown…
Multi-Stage Generalized Deferred Acceptance Mechanism: Strategyproof Mechanism for Handling General Hereditary Constraints
Kei Kimura, Kwei-guu Liu, Zhaohong Sun +2
The theory of two-sided matching has been extensively developed and applied to many real-life application domains. As the theory has been applied to increasingly diverse types of e…
Towards Optimal Subsidy Bounds for Envy-freeable Allocations
Yasushi Kawase, Kazuhisa Makino, Hanna Sumita +2
We study the fair division of indivisible items with subsidies among agents, where the absolute marginal valuation of each item is at most one. Under monotone valuations (where…
Subtraction games in more than one dimension
Urban Larsson, Indrajit Saha, Makoto Yokoo
This paper concerns two-player alternating play combinatorial games (Conway 1976) in the normal-play convention, i.e. last move wins. Specifically, we study impartial vector subtra…
Daycare Matching in Japan: Transfers and Siblings
Zhaohong Sun, Yoshihiro Takenami, Daisuke Moriwaki +2
In this paper, we study a daycare matching problem in Japan and report the design and implementation of a new centralized algorithm, which is going to be deployed in one municipali…
Fair and Truthful Mechanism with Limited Subsidy
Hiromichi Goko, Ayumi Igarashi, Yasushi Kawase +5
The notion of \emph{envy-freeness} is a natural and intuitive fairness requirement in resource allocation. With indivisible goods, such fair allocations are unfortunately not guara…
Strategy-Proof and Non-Wasteful Multi-Unit Auction via Social Network
Takehiro Kawasaki, Nathanael Barrot, Seiji Takanashi +2
Auctions via social network, pioneered by Li et al. (2017), have been attracting considerable attention in the literature of mechanism design for auctions. However, no known mechan…
False-Name-Proof Facility Location on Discrete Structures
Taiki Todo, Nodoka Okada, Makoto Yokoo
We consider the problem of locating a single facility on a vertex in a given graph based on agents' preferences, where the domain of the preferences is either single-peaked or sing…
New Algorithms for Functional Distributed Constraint Optimization Problems
Khoi D. Hoang, William Yeoh, Makoto Yokoo +1
The Distributed Constraint Optimization Problem (DCOP) formulation is a powerful tool to model multi-agent coordination problems that are distributed by nature. The formulation is…
Diffusion and Auction on Graphs
Bin Li, Dong Hao, Dengji Zhao +1
Auction is the common paradigm for resource allocation which is a fundamental problem in human society. Existing research indicates that the two primary objectives, the seller's re…
Efficiency in Truthful Auctions via a Social Network
Seiji Takanashi, Takehiro Kawasaki, Taiki Todo +1
In this paper, we study efficiency in truthful auctions via a social network, where a seller can only spread the information of an auction to the buyers through the buyers' network…
Robustness against Agent Failure in Hedonic Games
Ayumi Igarashi, Kazunori Ota, Yuko Sakurai +1
We study how stability can be maintained even after any set of at most k players leave their groups, in the context of hedonic games. While stability properties ensure an outcome t…
Distributed Constraint Problems for Utilitarian Agents with Privacy Concerns, Recast as POMDPs
Julien Savaux, Julien Vion, Sylvain Piechowiak +6
Privacy has traditionally been a major motivation for distributed problem solving. Distributed Constraint Satisfaction Problem (DisCSP) as well as Distributed Constraint Optimizati…
Repeated Multimarket Contact with Private Monitoring: A Belief-Free Approach
Atsushi Iwasaki, Tadashi Sekiguchi, Shun Yamamoto +1
This paper studies repeated games where two players play multiple duopolistic games simultaneously (multimarket contact). A key assumption is that each player receives a noisy and…
DisCSPs with Privacy Recast as Planning Problems for Utility-based Agents
Julien Savaux, Julien Vion, Sylvain Piechowiak +6
Privacy has traditionally been a major motivation for decentralized problem solving. However, even though several metrics have been proposed to quantify it, none of them is easily…
Utilitarian Distributed Constraint Optimization Problems
Julien Savaux, Julien Vion, Sylvain Piechowiak +6
Privacy has been a major motivation for distributed problem optimization. However, even though several methods have been proposed to evaluate it, none of them is widely used. The D…
False-name-proof Mechanisms for Hiring a Team
Atsushi Iwasaki, David Kempe, Mahyar Salek +1
We study the problem of hiring a team of selfish agents to perform a task. Each agent is assumed to own one or more elements of a set system, and the auctioneer is trying to purcha…
Autonomy with regard to an Attribute
Eric Sanchis
This paper presents a model of autonomy called autonomy with regard to an attribute applicable to cognitive and not cognitive artificial agents. Three criteria (global / partial, s…