15,662,737 members
Home / Discussions / Algorithms

# Algorithms

 Re: Time Complexity of following method? Member 1546299610-Dec-21 5:08 Member 15462996 10-Dec-21 5:08
 NUMBER OF COMBINATIONS OF THE ARRANGEMENT OF CAPS Member 1543482417-Nov-21 13:48 Member 15434824 17-Nov-21 13:48
 Re: NUMBER OF COMBINATIONS OF THE ARRANGEMENT OF CAPS Greg Utas23-Nov-21 5:14 Greg Utas 23-Nov-21 5:14
 C# Member 153810723-Oct-21 21:36 Member 15381072 3-Oct-21 21:36
 Re: C# Richard MacCutchan3-Oct-21 21:49 Richard MacCutchan 3-Oct-21 21:49
 Function of algorithm danindya1-Sep-21 15:52 danindya 1-Sep-21 15:52
 Re: Function of algorithm - Spammer Dave Kreskowiak1-Sep-21 16:23 Dave Kreskowiak 1-Sep-21 16:23
 Help with allocation algorithm Cynthia Moore24-Aug-21 19:43 Cynthia Moore 24-Aug-21 19:43
 Hi, I am new here. I hope I am doing this right. If not, please advise. I signed up to handle a neighborhood project that involves distributing about 700 items to anyone in the neighborhood who wants them. I have created an Access database containing the items with details such as the size, weight, and condition (very good to poor). I also have a Google Sheet that I populated from the database. It has one row for each item. There are columns for each of the properties (description, size, weight, condition etc.). These are all read only (protected). The first column is the selection column. In it, the neighbor can indicate whether they want that item or not. My current thinking is to let them enter a priority number (1-10) or leave it blank. I will allow each neighbor to access a copy of that sheet and fill in their choices. When they are all done, I will lock the sheets and import the priority columns to Excel where I am more comfortable. I have the code roughed out that will do the actual allocations. My remaining task is to devise an algorithm for allocating items that are selected by multiple people. I could just select randomly, but I'd like an algorithm that does the allocation as fairly as possible. I realize that "fairly" is subjective. I currently have about 20 people who have said they want some of the items. At least one person said they would take them all. The algorithm will start by allocating all of the items that are selected by just one person. My current thinking for the items selected by multiple people is to calculate some measure of the percentage of the items they requested that they have already been given. Suppose A & B both choose item 143, A has 20% of their requests, and B has 30% of theirs. I could then award that item to A or, since B has 3/2 as much of their selections as does A, I could generate a random number from 1-5 and award it to A if it's 1-3, and B if 4-5. Or I could skew it more in favor of A, the one with the lower percentage. I'm not entirely happy with this algorithm for a couple of reasons. (1) It doesn't take into account the priority choice. What if A choose the item with a priority of 5, but B chose with with a priority of 1? (2) I'm not sure of it takes into account how many items each one chose. If B only chose 1 item but A chose 100, should that one go to B, because if not, they get nothing? I would appreciate any suggestions for good ways to handle this. Thanks
 Re: Help with allocation algorithm Gerry Schmitz25-Aug-21 18:49 Gerry Schmitz 25-Aug-21 18:49
 Re: Help with allocation algorithm Cynthia Moore25-Aug-21 19:42 Cynthia Moore 25-Aug-21 19:42
 Re: Help with allocation algorithm Gerry Schmitz26-Aug-21 4:37 Gerry Schmitz 26-Aug-21 4:37
 Re: Help with allocation algorithm Cynthia Moore26-Aug-21 7:16 Cynthia Moore 26-Aug-21 7:16
 Re: Help with allocation algorithm BillWoodruff28-Aug-21 16:09 BillWoodruff 28-Aug-21 16:09
 Which is the more preferred approach for novice coders, depth first search, or, breadth first search? the prestige city23-Jul-21 1:23 the prestige city 23-Jul-21 1:23
 Re: Which is the more preferred approach for novice coders, depth first search, or, breadth first search? Gerry Schmitz24-Jul-21 7:15 Gerry Schmitz 24-Jul-21 7:15
 Re: Which is the more preferred approach for novice coders, depth first search, or, breadth first search? David Camp5-Oct-22 14:51 David Camp 5-Oct-22 14:51
 Re: Which is the more preferred approach for novice coders, depth first search, or, breadth first search? prestige primrose hills phase 210-Nov-22 22:21 prestige primrose hills phase 2 10-Nov-22 22:21
 Find cartesians for matrix elements Member 1528858613-Jul-21 19:38 Member 15288586 13-Jul-21 19:38
 Guess A Word If Number Of Character Matches Are Given Member 1525570320-Jun-21 20:54 Member 15255703 20-Jun-21 20:54
 Re: Guess A Word If Number Of Character Matches Are Given OriginalGriff20-Jun-21 21:01 OriginalGriff 20-Jun-21 21:01
 What are the in-order and post-order traversals of the following tree? priyamtheone20-May-21 5:02 priyamtheone 20-May-21 5:02
 Re: What are the in-order and post-order traversals of the following tree? harold aptroot20-May-21 7:08 harold aptroot 20-May-21 7:08
 Re: What are the in-order and post-order traversals of the following tree? priyamtheone20-May-21 9:37 priyamtheone 20-May-21 9:37
 Re: What are the in-order and post-order traversals of the following tree? harold aptroot20-May-21 9:48 harold aptroot 20-May-21 9:48
 Algorithm to rank items lower if they already appear higher in another category Member 117824613-Mar-21 19:41 Member 11782461 3-Mar-21 19:41
 Last Visit: 31-Dec-99 18:00     Last Update: 28-May-23 6:04 Refresh ᐊ Prev1...45678910111213 Next ᐅ