-
Computing a Subgame Perfect Equilibrium of a Sequential Matching Game
We study a decentralized matching market in which each firm sequentially...
04/27/2018 ∙ by Yasushi Kawase, et al. ∙
0
∙
share
read it
-
Subgame Perfect Equilibria of Sequential Matching Games
We study a decentralized matching market in which firms sequentially mak...
04/27/2018 ∙ by Yasushi Kawase, et al. ∙
0
∙
share
read it
-
Finding a Path in Group-Labeled Graphs with Two Labels Forbidden
The parity of the length of paths and cycles is a classical and well-stu...
06/30/2018 ∙ by Yasushi Kawase, et al. ∙
0
∙
share
read it
-
Tight Approximation for Unconstrained XOS Maximization
A set function is called XOS if it can be represented by the maximum of ...
11/22/2018 ∙ by Yasushi Kawase, et al. ∙
0
∙
share
read it
-
A Dijkstra-Based Efficient Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs
The parity constrained shortest path problem is a well-known variant tha...
06/10/2019 ∙ by Yutaro Yamaguchi, et al. ∙
0
∙
share
read it
-
A Strongly Polynomial Algorithm for Finding a Shortest Non-zero Path in Group-Labeled Graphs
Finding a shortest path or cycle in graphs is a fundamental problem. In ...
06/10/2019 ∙ by Yutaro Yamaguchi, et al. ∙
0
∙
share
read it
-
Stochastic Monotone Submodular Maximization with Queries
We study a stochastic variant of monotone submodular maximization proble...
07/09/2019 ∙ by Takanori Maehara, et al. ∙
0
∙
share
read it
-
Multiple Knapsack-Constrained Monotone DR-Submodular Maximization on Distributive Lattice --- Continuous Greedy Algorithm on Median Complex ---
We consider a problem of maximizing a monotone DR-submodular function un...
07/09/2019 ∙ by Takanori Maehara, et al. ∙
0
∙
share
read it
-
List colouring of two matroids through reduction to partition matroids
In the list colouring problem for two matroids, we are given matroids M_...
11/24/2019 ∙ by Kristóf Bérczi, et al. ∙
0
∙
share
read it
