49 citations · 49 across the 2 of their papers we have counts for
7 papers · 1 filter
Provably Fast and Accurate Recovery of Evolutionary Trees through Harmonic Greedy Triplets
Miklos Csuros, Ming-Yang Kao
We give a greedy learning algorithm for reconstructing an evolutionary tree based on a certain harmonic average on triplets of terminal taxa. After the pairwise distances between t…
Optimal Bidding Algorithms Against Cheating in Multiple-Object Auctions
Ming-Yang Kao, Junfeng Qi, Lei Tan
This paper studies some basic problems in a multiple-object auction model using methodologies from theoretical computer science. We are especially concerned with situations where a…
Optimal Buy-and-Hold Strategies for Financial Markets with Bounded Daily Returns
Gen-Huey Chen, Ming-Yang Kao, Yuh-Dauh Lyuu +1
In the context of investment analysis, we formulate an abstract online computing problem called a planning game and develop general tools for solving such a game. We then use the t…
Designing Proxies for Stock Market Indices is Computationally Hard
Ming-Yang Kao, Stephen R. Tate
In this paper, we study the problem of designing proxies (or portfolios) for various stock market indices based on historical data. We use four different methods for computing mark…
A Decomposition Theorem for Maximum Weight Bipartite Matchings
Ming-Yang Kao, Tak-Wah Lam, Wing-Kin Sung +1
Let G be a bipartite graph with positive integer weights on the edges and without isolated nodes. Let n, N and W be the node count, the largest edge weight and the total weight of…
Opportunity Cost Algorithms for Combinatorial Auctions
Karhan Akcoglu, James Aspnes, Bhaskar DasGupta +1
Two general algorithms based on opportunity costs are given for approximating a revenue-maximizing set of bids an auctioneer should accept, in a combinatorial auction in which each…