Exact analysis of Exact change Northeastern University精确变化的精确分析东北大学.pptVIP

Exact Analysis of Exact Change Yair Frankel, CertCo Boaz Patt-Shamir, Northeastern University Yiannis Tsiounis, Northeastern University/GTE At the bank... YOU: I would like to withdraw N shekels… THE TELLER: How would you like to have it? YOU: hmm… I need to make a few exact payments... The k-payment problem Withdraw budget N to enable k arbitrary payments with minimal number of coins We need algorithms for: Coin allocation Coin dispensing Applications Physical cash Minimize coins in physical withdrawals “Exact change” ATM machines Electronic cash: smart cards have limited storage, electronic coins are long sequences... Construct e-cash systems allowing exact payments Other resource sharing scenarios A simple solution Replicate the 1-payment solution k times : Split budget into k portions of size N/k and solve for 1-payment for each portion Requires about k?log2(N/k) coins However... How about payments larger than N/k? What if N/k is not of the form 2m-1? Is this the best solution? This talk... Some intuition for the lower bound Description of the coin allocation algorithm Idea for restricted denominations The allocation algorithm Exact analysis Optimality: There is no way to allocate less coins for any N, k. Upper bound: The number of coins allocated by the algorithm is never more than (k+1)?H ?N/(k+1)? ?(k+1)? ln(N/(k+1)) (reduction, anyone?) Restricted denominations: the problem Not all denominations are available Related problems: Change making: dispense a single payment with least number of coins postage stamp problem Restricted denominations: the solution Same basic idea: Allocate coins while preserving the invariant Use change making algorithm to allocate the remainder (dynamic programming always works) Proof is more involved No specific bounds on the number of coins * * Northeastern University/ GTE Laboratories Northeastern University/ GTE Laboratories Easy cases No restrictions: up to N payments (the N-payment problem) A single payment of any value P