Sciweavers

ALGORITHMICA
2010
152views more  ALGORITHMICA 2010»
13 years 11 months ago
Gaming Prediction Markets: Equilibrium Strategies with a Market Maker
We study the equilibrium behavior of informed traders interacting with market scoring rule (MSR) market makers. One attractive feature of MSR is that it is myopically incentive com...
Yiling Chen, Stanko Dimitrov, Rahul Sami, Daniel M...
ALGORITHMICA
2010
137views more  ALGORITHMICA 2010»
13 years 11 months ago
A Fully Dynamic Graph Algorithm for Recognizing Interval Graphs
We present the first dynamic graph algorithm for recognizing interval graphs. The algorithm runs in O(n log n) worst-case time per edge deletion or edge insertion, where n is the ...
Louis Ibarra
ALGORITHMICA
2010
141views more  ALGORITHMICA 2010»
13 years 11 months ago
Compressed Indexes for Approximate String Matching
Ho-Leung Chan, Tak Wah Lam, Wing-Kin Sung, Siu-Lun...
ALGORITHMICA
2010
159views more  ALGORITHMICA 2010»
13 years 11 months ago
Almost Stable Matchings by Truncating the Gale-Shapley Algorithm
We show that the ratio of matched individuals to blocking pairs grows linearly with the number of propose
Patrik Floréen, Petteri Kaski, Valentin Pol...
ALGORITHMICA
2010
143views more  ALGORITHMICA 2010»
13 years 11 months ago
Absolute and Asymptotic Bounds for Online Frequency Allocation in Cellular Networks
Given a cellular (mobile telephone) network, whose geographical coverage area is divided into hexagonal cells, phone calls are serviced by assigning frequencies to them so that no...
Joseph Wun-Tat Chan, Francis Y. L. Chin, Deshi Ye,...
ALGORITHMICA
2010
108views more  ALGORITHMICA 2010»
13 years 11 months ago
An Efficient Algorithm for Batch Stability Testing
Given a stable marriage problem instance represented by a bipartite graph having 2n vertices and m edges, we describe an algorithm that can verify the stability of k different mat...
John Dabney, Brian C. Dean
ALGORITHMICA
2010
125views more  ALGORITHMICA 2010»
13 years 11 months ago
On the Fastest Vickrey Algorithm
We investigate the algorithmic performance of Vickrey-Clarke-Groves mechanisms in the single item case. We provide a formal definition of a Vickrey algorithm for this framework, a...
Elena Grigorieva, P. Jean-Jacques Herings, Rudolf ...
ALGORITHMICA
2010
82views more  ALGORITHMICA 2010»
13 years 11 months ago
Fractional Path Coloring in Bounded Degree Trees with Applications
Ioannis Caragiannis, Afonso Ferreira, Christos Kak...
ALGORITHMICA
2010
112views more  ALGORITHMICA 2010»
13 years 11 months ago
On Metric Clustering to Minimize the Sum of Radii
Abstract Given an n-point metric (P,d) and an integer k > 0, we consider the problem of covering P by k balls so as to minimize the sum of the radii of the balls. We present a r...
Matt Gibson, Gaurav Kanade, Erik Krohn, Imran A. P...
ALGORITHMICA
2010
156views more  ALGORITHMICA 2010»
13 years 11 months ago
On Covering Problems of Rado
T. Rado conjectured in 1928 that if S is a finite set of axis-parallel squares in the plane, then there exists an independent subset I S of pairwise disjoint squares, such that I ...
Sergey Bereg, Adrian Dumitrescu, Minghui Jiang