#### Filter Results:

#### Publication Year

1989

2016

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- ERIC BUDISH, Mihai Manea, Herve Moulin, Tayfun Sönmez, Tomomi Matsui, Akihisa Tamura +1 other
- 2011

Randomization is a common feature of everyday resource allocation. We generalize the theory of randomized assignment to accommodate various real-world constraints such as group-specific quotas (" controlled choice ") in school choice and house allocation, and scheduling and curriculum constraints in course allocation. We develop new mechanisms that are ex… (More)

In this paper, we prove that both problems for calculating the Banzhaf power index and the Shapley–Shubik power index for weighted majority games are NP-complete.

In sports timetabling, finding feasible pattern sets for a round robin tournament is a significant problem. Although this problem has been tackled in several ways, good characterization of feasible pattern sets is not known yet. In this paper, we consider the feasibility of a pattern set, and propose a necessary condition for feasible pattern sets. In the… (More)

Consider two orthogonal closed chains on a cylinder. These chains are monotone with respect to the tangential Θ direction. We wish to rigidly move one chain so that the total area between the two is minimized. This minimization is a geometric measure of similarity between two melodies proposed by´O Maidín. The Θ direction represents time and the axial… (More)

|This paper describes an algorithm for nding all the perfect matchings in a bipartite graph. By using the binary partitioning method, our algorithm requires O(c(n + m) + n 2:5) computational eort and O(nm) memory storage, (where n denotes the number of vertices, m denotes the number of edges, and c denotes the number of perfect matchings in the given… (More)

Unit disk graphs are the intersection graphs of equal sized circles in the plane. In this paper, we consider the maximum independent set problems on unit disk graphs. When the given unit disk graph is dened on a slab whose width is k, we propose an algorithm for nding a maximum independent set in O(n 4d2k= p 3e) time where n denotes the number of vertices.… (More)

- Greg Aloupis, Thomas Fevens, Stefan Langerman, Tomomi Matsui, Antonio Mesa, Yurai Núñez Rodríguez +2 others
- CCCG
- 2003

Consider two orthogonal closed chains on a cylinder. The chains are monotone with respect to the angle Θ. We wish to rigidly move one chain so that the total area between the two chains is minimized. This is a geometric measure of similarity between two repeating melodies proposed by´O Maidín. We present an O(n) time algorithm to compute this measure if Θ… (More)

The Traveling Tournament Problem is a complex combinatorial optimization problem in tournament timetabling, which asks a schedule of home/away games meeting specific feasibility requirements , while also minimizing the total distance traveled by all the n teams (n is even). Despite intensive algorithmic research on this problem over the last decade, most… (More)

We propose a 0.935-approximation algorithm for MAX 2SAT and a 0.863-approximation algorithm for MAX DICUT. The approximation ratios improve upon the recent results of Zwick, which are equal to 0.93109 and 0.8596434254 respectively. Also proposed are derandomized versions of the same approximation ratios. We note that these approximation ratios are obtained… (More)