source: src/main/java/agents/anac/y2019/agentperaltav2/ConstraintsTable.java@ 204

package agents.anac.y2019.agentperaltav2;

import java.util.ArrayList;
import java.util.HashMap;
import java.util.List;
import java.util.Map;

import agents.anac.y2019.agentperaltav2.it.ssc.pl.milp.ConsType;
import genius.core.Bid;
import genius.core.issue.Value;




public class ConstraintsTable {
        public ArrayList <Value> valueList = new ArrayList<Value>();
        public double[][] constraintLeftSide;
        public double[] constraintRightSide;
        public double[] objectiveFunc;
        public ConsType[] constraintOperator;
        public double[] simplexResults;
        
        public ConstraintsTable() {
    }
        
        public void estimateSides(List<Bid> bidOrder) throws Exception {
                HashMap<Integer, Value> map = new HashMap<Integer, Value>();
                map = bidOrder.get(0).getValues();
                Value[][] nameValues = new Value[bidOrder.size()][map.size()]; 
                Double [] pointValues = new Double[bidOrder.size()];
                //System.out.println("to megethos einai:"+bidOrder.size());
                for(int k=0;k<bidOrder.size();k++) {
                        map = bidOrder.get(k).getValues();
                        int[] keys = new int[map.size()];
                        Value[] values = new Value[map.size()];
                        int i=0;
                        for (Map.Entry<Integer, Value> entry : map.entrySet()) {
                                keys[i] = entry.getKey();
                                values[i++] = entry.getValue();
                        }
                        pointValues[k] = (double)k;
                        for (i = 0; i < map.size(); i++) {
                                nameValues[k][i] = values[i];
                        }
                }
                valueList.add(nameValues[0][0]);
                for (int j=0;j<map.size();j++) {
                        for (int i=0;i<bidOrder.size();i++) {
                                if(!valueList.contains(nameValues[i][j])) {
                                        valueList.add(nameValues[i][j]);
                                }
                        }
                }
                int numOfCompares = 0;  
                //initialize of arrays
                numOfCompares = bidOrder.size()+1;
                constraintLeftSide = new double[numOfCompares][valueList.size()];
                constraintRightSide = new double[numOfCompares];
                objectiveFunc = new double[valueList.size()];
                constraintOperator = new ConsType[numOfCompares];
                simplexResults = new double[valueList.size()];
                for (int i=0; i<numOfCompares; i++) {
                        constraintRightSide[i]=0;
                        constraintOperator[i] = ConsType.GE;
                        if (i == numOfCompares-2|| i==numOfCompares-1) {
                                constraintRightSide[i] = 1;
                                constraintOperator[i] = ConsType.EQ;
                        }
                        for (int j=0; j<valueList.size(); j++) {
                                constraintLeftSide[i][j] = 0;
                                objectiveFunc[j] = 0;
                                simplexResults[j] = 0;
                        }
                }
                
                for (int i=numOfCompares-2; i>=1; i--) {
                        for (int j=0; j<map.size(); j++) {
                                if (nameValues[i][j] == nameValues[i-1][j]) {
                                        for (int k=0; k<valueList.size(); k++) {
                                                if (nameValues[i][j]==valueList.get(k)) {
                                                        constraintLeftSide[i-1][k] = 0;
                                                }
                                        }
                                }
                                else if(nameValues[i][j] != nameValues[i-1][j]) {
                                        for (int k=0; k<valueList.size(); k++) {
                                                if (nameValues[i][j]==valueList.get(k)) {
                                                        constraintLeftSide[i-1][k] = 1;
                                                }
                                                if (nameValues[i-1][j]==valueList.get(k)) {
                                                        constraintLeftSide[i-1][k] = -1;
                                                }
                                        }
                                        
                                }
                        }
                }
                for (int j=0; j<map.size(); j++) {
                        for (int k=0; k<valueList.size(); k++) {
                                if (nameValues[bidOrder.size()-1][j]==valueList.get(k)) {
                                        constraintLeftSide[numOfCompares-1][k] = 1;
                                }
                        }
                }
                
                for (int i=0;i<numOfCompares-2;i++) {
                        for (int j =0; j<valueList.size();j++) {
                                constraintLeftSide[numOfCompares-2][j] = constraintLeftSide[numOfCompares-2][j]+constraintLeftSide[i][j];
                        }
                }
                
                /*for (int i=0;i<valueList.size();i++) {
                        System.out.println("to "+valueList.get(i)+" exei arithmo:" +i);
                }
                for (int i=0;i<numOfCompares;i++) {
                        for (int j =0; j<valueList.size();j++) {
                                //System.out.println("{"+objectiveFunc[j]+"}");
                                System.out.print(""+constraintLeftSide[i][j]+", ");
                        }
                        System.out.println("");
                }*/
                
                MySimplex mySimplex = new MySimplex();
                mySimplex.RunSimplexAlgorithm(constraintLeftSide,constraintRightSide,objectiveFunc,constraintOperator);
                simplexResults = mySimplex.d.clone();
                
                
        }
        
        
        public double estimateUtilityBid(Bid receivedBid){
                HashMap<Integer, Value> map = new HashMap<Integer, Value>();    
                map = receivedBid.getValues();
                int[] keys = new int[map.size()];
                Value[] values = new Value[map.size()];
                int i=0;
                for (Map.Entry<Integer, Value> entry : map.entrySet()) {
                        keys[i] = entry.getKey();
                        values[i++] = entry.getValue();
                }
                double bidUtility = 0;
                for (int j=0; j<map.size();j++) {
                        if (valueList.contains(values[j])) {
                                bidUtility  = bidUtility + simplexResults[valueList.indexOf(values[j])];
                        }
                }
                return bidUtility;
                
        }
        
}