ESA 2006 - PDF Preprint Papers

ESA 2006 European Symposium on Algorithms

Teaser Browsing | Click Here

Title Browsing | Click Here

Wall of Fame | Most Viewed ESA-2006 Paper

click to vote

ESA
2006
Springer

207views Algorithms» more ESA 2006»

Cheating by Men in the Gale-Shapley Stable Matching Algorithm

14 years 4 months ago

Download www.mpi-inf.mpg.de

Abstract. This paper addresses strategies for the stable marriage problem. For the Gale-Shapley algorithm with men proposing, a classical theorem states that it is impossible for e...

Chien-Chung Huang

claim paper

Read More »

Disclaimer and Copyright Notice

Sciweavers respects the rights of all copyright holders and in this regard, authors are only allowed to share a link to their preprint paper on their own website. Every contribution is associated with a desciptive image. It is the sole responsibility of the authors to ensure that their posted image is not copyright infringing. This service is compliant with IEEE copyright.

Id	Views	Title	Status

1	207	Cheating by Men in the Gale-Shapley Stable Matching Algorithm	claim
2	194	Popular Matchings in the Capacitated House Allocation Problem	claim
3	189	Exact and Efficient Construction of Planar Minkowski Sums Using the Convolution Method	claim
4	158	Algorithmic Aspects of Proportional Symbol Maps	claim
5	147	Univariate Polynomial Real Root Isolation: Continued Fractions Revisited	claim
6	146	Balancing Applied to Maximum Network Flow Problems	claim
7	140	Latency Constrained Aggregation in Sensor Networks	claim
8	139	Stochastic Shortest Paths Via Quasi-convex Maximization	claim
9	137	Deciding Relaxed Two-Colorability - A Hardness Jump	claim
10	136	Approximation in Preemptive Stochastic Online Scheduling	claim
11	134	An Improved Construction for Counting Bloom Filters	claim
12	134	Graph Coloring with Rejection	claim
13	134	A Unified Approach to Approximating Partial Covering Problems	claim
14	131	Finding Total Unimodularity in Optimization Problems Solved by Linear Programs	claim
15	130	Reporting Flock Patterns	claim
16	130	Robust, Generic and Efficient Construction of Envelopes of Surfaces in Three-Dimensional Spaces	claim
17	126	Cooperative TSP	claim
18	125	Region-Restricted Clustering for Geographic Data Mining	claim
19	125	Purely Functional Worst Case Constant Time Catenable Sorted Lists	claim
20	118	Subspace Sampling and Relative-Error Matrix Approximation: Column-Row-Based Methods	claim
21	113	An LP-Designed Algorithm for Constraint Satisfaction	claim
22	112	Enumerating Spanning and Connected Subsets in Graphs and Matroids	claim
23	111	Kinetic Collision Detection for Convex Fat Objects	claim
24	111	Path Hitting in Acyclic Graphs	claim
25	111	Approximate k-Steiner Forests Via the Lagrangian Relaxation Technique with Internal Preprocessing	claim
26	109	Multiline Addressing by Network Flow	claim
27	108	Lower and Upper Bounds on FIFO Buffer Management in QoS Switches	claim
28	106	Less Hashing, Same Performance: Building a Better Bloom Filter	claim
29	105	Dynamic Programming and Fast Matrix Multiplication	claim
30	105	Near-Entropy Hotlink Assignments	claim
31	105	Navigating Low-Dimensional and Hierarchical Population Networks	claim
32	105	Minimum Transversals in Posi-modular Systems	claim
33	103	Greedy in Approximation Algorithms	claim
34	102	Necklaces, Convolutions, and X + Y	claim
35	98	Taxes for Linear Atomic Congestion Games	claim
36	96	Finite Termination of "Augmenting Path" Algorithms in the Presence of Irrational Problem Data	claim
37	95	Resource Allocation in Bounded Degree Trees	claim
38	95	Distributed Almost Exact Approximations for Minor-Closed Families	claim
39	94	Contention Resolution with Heterogeneous Job Sizes	claim
40	92	Out-of-Order Event Processing in Kinetic Data Structures	claim
41	92	Skewed Binary Search Trees	claim
42	90	Competitive Analysis of Flash-Memory Algorithms	claim
43	89	Spanners with Slack	claim
44	89	Spectral Clustering by Recursive Partitioning	claim
45	88	Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem	claim
46	86	Dynamic Algorithms for Graph Spanners	claim
47	84	The Engineering of a Compression Boosting Library: Theory vs Practice in BWT Compression	claim
48	82	Preemptive Online Scheduling: Optimal Algorithms for All Speeds	claim
49	82	The Price of Resiliency: A Case Study on Sorting with Memory Faults	claim
50	81	Estimating Entropy over Data Streams	claim
51	77	Negative Examples for Sequential Importance Sampling of Binary Contingency Tables	claim
52	77	Traversing the Machining Graph	claim
53	76	Parallel Machine Scheduling Through Column Generation: Minimax Objective Functions	claim
54	72	I/O-Efficient Undirected Shortest Paths with Unbounded Edge Lengths	claim
55	70	Kinetic Algorithms Via Self-adjusting Computation	claim

Sciweavers

Explore & Download

Productivity Tools

Document Tools

Image Tools

Sciweavers