Patents by Inventor Sarit Kraus
Sarit Kraus has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Publication number: 20140279818Abstract: Game theory models may be used for producing a strategy and schedule for patrolling an area like a rail transportation system. In some instances, the model may account for events that cause a patrol unit to deviate from a patrol schedule and route. For example, a patrol schedule may be generated for one or more patrol units using a Bayesian Stackelberg game theory model based on a map of the public transportation system, a schedule of the transports, a list of the one or more patrolling units, a probability distribution for the occurrence of the passenger not paying to ride the transports, a list of the one or more possible events that would delay the patrol units, and a probability distribution for the occurrence of the one or more possible events that would delay the patrolling units represented by a Markov-decision process.Type: ApplicationFiled: March 17, 2014Publication date: September 18, 2014Applicant: UNIVERSITY OF SOUTHERN CALIFORNIAInventors: Albert Xin Jiang, Zhengyu Yin, Chao Zhang, Milind Tambe, Sarit Kraus
-
Patent number: 8364511Abstract: Efficient heuristic methods are described for approximating the optimal leader strategy for security domains where threats come from unknown adversaries. These problems can be modeled as Bayes-Stackelberg games. An embodiment of the heuristic method can include defining a patrolling or security domain problem as a mixed-integer quadratic program. The mixed-integer quadratic program can be converted to a mixed-integer linear program. For a single follower (e.g., robber or terrorist) scenario, the mixed-integer linear program can be solved, subject to appropriate constraints. For embodiments applicable to multiple follower situations, the relevant mixed-integer quadratic program and related mixed-integer linear program can be decomposed, e.g., by changing the response function for the follower from a pure strategy to a weighted combination over various pure follower strategies where the weights are probabilities of occurrence of each of the follower types.Type: GrantFiled: May 24, 2012Date of Patent: January 29, 2013Assignee: University of Southern CaliforniaInventors: Milind Tambe, Praveen Paruchuri, Fernando Ordóñez, Sarit Kraus, Jonathan Pearce, Janusz Marecki
-
Publication number: 20120330727Abstract: Efficient heuristic methods are described for approximating the optimal leader strategy for security domains where threats come from unknown adversaries. These problems can be modeled as Bayes-Stackelberg games. An embodiment of the heuristic method can include defining a patrolling or security domain problem as a mixed-integer quadratic program. The mixed-integer quadratic program can be converted to a mixed-integer linear program. For a single follower (e.g., robber or terrorist) scenario, the mixed-integer linear program can be solved, subject to appropriate constraints. For embodiments applicable to multiple follower situations, the relevant mixed-integer quadratic program and related mixed-integer linear program can be decomposed, e.g., by changing the response function for the follower from a pure strategy to a weighted combination over various pure follower strategies where the weights are probabilities of occurrence of each of the follower types.Type: ApplicationFiled: May 24, 2012Publication date: December 27, 2012Applicant: UNIVERSITY OF SOUTHERN CALIFORNIAInventors: Milind Tambe, Praveen Paruchuri, Fernando Ordóñez, Sarit Kraus, Jonathan Pearce, Janusz Marecki
-
Patent number: 8224681Abstract: Techniques are described for Stackelberg games, in which one agent (the leader) must commit to a strategy that can be observed by other agents (the followers or adversaries) before they choose their own strategies, in which the leader is uncertain about the types of adversaries it may face. Such games are important in security domains, where, for example, a security agent (leader) must commit to a strategy of patrolling certain areas, and robbers (followers) have a chance to observe this strategy over time before choosing their own strategies of where to attack. An efficient exact algorithm is described for finding the optimal strategy for the leader to commit to in these games. This algorithm, Decomposed Optimal Bayesian Stackelberg Solver or “DOBSS,” is based on a novel and compact mixed-integer linear programming formulation. The algorithm can be implemented in a method, software, and/or system including computer or processor functionality.Type: GrantFiled: October 17, 2008Date of Patent: July 17, 2012Assignee: University of Southern CaliforniaInventors: Milind Tambe, Praveen Paruchuri, Fernando Ordóñez, Sarit Kraus, Jonathan Pearce, Janusz Marecki
-
Patent number: 8195490Abstract: Efficient heuristic methods are described for approximating the optimal leader strategy for security domains where threats come from unknown adversaries. These problems can be modeled as Bayes-Stackelberg games. An embodiment of the heuristic method can include defining a patrolling or security domain problem as a mixed-integer quadratic program. The mixed-integer quadratic program can be converted to a mixed-integer linear program. For a single follower (e.g., robber or terrorist) scenario, the mixed-integer linear program can be solved, subject to appropriate constraints. For embodiments applicable to multiple follower situations, the relevant mixed-integer quadratic program and related mixed-integer linear program can be decomposed, e.g., by changing the response function for the follower from a pure strategy to a weighted combination over various pure follower strategies where the weights are probabilities of occurrence of each of the follower types.Type: GrantFiled: October 15, 2008Date of Patent: June 5, 2012Assignee: University of Southern CaliforniaInventors: Milind Tambe, Praveen Paruchuri, Fernando Ordóñez, Sarit Kraus, Jonathan Pearce, Janusz Marecki
-
Patent number: 8038061Abstract: A method for voting by peers via mobile devices operating in a network on behalf of their owners, comprising iteratively sending by a plurality of peers votes for candidates to a peer and determining by the peer, according to the votes, at least one winner candidate.Type: GrantFiled: October 1, 2007Date of Patent: October 18, 2011Assignee: Samsung Electronics Co., Ltd.Inventors: Meir Kalech, Sarit Kraus, Gal A. Kaminka, Claudia V. Goldman-Shenhar
-
Patent number: 7808909Abstract: A multi-node network that comprises a plurality of nodes, at least one of the nodes comprises a local cache for storing a plurality of matching indications at least some of which associated with a potential node. A receiving node of the plurality of nodes that is configured for receiving a matching request having a requested matching indication associated with an address of an additional node of the plurality of nodes. The receiving node is configured for identifying a match between the receiving node and at least one of the associated potential nodes by matching the requested matching indication and the stored matching indications and for informing one or more of the receiving nodes and the associated nodes about the match.Type: GrantFiled: October 1, 2007Date of Patent: October 5, 2010Assignee: Samsung Electronics Co., Ltd.Inventors: Victor Shufrun, Gal A. Kaminka, Sarit Kraus, Claudia V. Goldman-Shenhar
-
Publication number: 20090119239Abstract: Efficient heuristic methods are described for approximating the optimal leader strategy for security domains where threats come from unknown adversaries. These problems can be modeled as Bayes-Stackelberg games. An embodiment of the heuristic method can include defining a patrolling or security domain problem as a mixed-integer quadratic program. The mixed-integer quadratic program can be converted to a mixed-integer linear program. For a single follower (e.g., robber or terrorist) scenario, the mixed-integer linear program can be solved, subject to appropriate constraints. For embodiments applicable to multiple follower situations, the relevant mixed-integer quadratic program and related mixed-integer linear program can be decomposed, e.g., by changing the response function for the follower from a pure strategy to a weighted combination over various pure follower strategies where the weights are probabilities of occurrence of each of the follower types.Type: ApplicationFiled: October 15, 2008Publication date: May 7, 2009Applicant: UNIVERSITY OF SOUTHERN CALIFORNIAInventors: Milind Tambe, Praveen Paruchuri, Fernando Ordonez, Sarit Kraus, Jonathan Pearce, Janusz Marecki
-
Publication number: 20090099987Abstract: Techniques are described for Stackelberg games, in which one agent (the leader) must commit to a strategy that can be observed by other agents (the followers or adversaries) before they choose their own strategies, in which the leader is uncertain about the types of adversaries it may face. Such games are important in security domains, where, for example, a security agent (leader) must commit to a strategy of patrolling certain areas, and robbers (followers) have a chance to observe this strategy over time before choosing their own strategies of where to attack. An efficient exact algorithm is described for finding the optimal strategy for the leader to commit to in these games. This algorithm, Decomposed Optimal Bayesian Stackelberg Solver or “DOBSS,” is based on a novel and compact mixed-integer linear programming formulation. The algorithm can be implemented in a method, software, and/or system including computer or processor functionality.Type: ApplicationFiled: October 17, 2008Publication date: April 16, 2009Applicant: UNIVERSITY OF SOUTHERN CALIFORNIAInventors: Milind Tambe, Praveen Paruchuri, Fernando Ordonez, Sarit Kraus, Jonathan Pearce, Janusz Marecki
-
Publication number: 20090084837Abstract: A method for voting by peers via mobile devices operating in a network on behalf of their owners, comprising iteratively sending by a plurality of peers votes for candidates to a peer and determining by the peer, according to the votes, at least one winner candidate.Type: ApplicationFiled: October 1, 2007Publication date: April 2, 2009Applicant: Samsung Electronics Co., Ltd.Inventors: Meir Kalech, Sarit Kraus, Gal A. Kaminka, Claudia V. Goldman-Shenhar
-
Publication number: 20090086745Abstract: A multi-node network that comprises a plurality of nodes, at least one of the nodes comprises a local cache for storing a plurality of matching indications at least some of which associated with a potential node. A receiving node of the plurality of nodes that is configured for receiving a matching request having a requested matching indication associated with an address of an additional node of the plurality of nodes. The receiving node is configured for identifying a match between the receiving node and at least one of the associated potential nodes by matching the requested matching indication and the stored matching indications and for informing one or more of the receiving nodes and the associated nodes about the match.Type: ApplicationFiled: October 1, 2007Publication date: April 2, 2009Applicant: Samsung Electronics Co., LtdInventors: Victor Shufrun, Gal A. Kaminka, Sarit Kraus, Claudia V. Goldman-Shenhar
-
Publication number: 20090037529Abstract: A method for cooperation between mobile devices peers representing social relations of the owners of the peers, comprising (a) providing a plurality of peers in a network and cooperating in a manner which utilizes resources of the devices responsive to the social relations.Type: ApplicationFiled: July 31, 2007Publication date: February 5, 2009Applicant: Samsung Electronics Co., Ltd.Inventors: Gilad Armon-Kest, Sarit Kraus, Gal A. Kaminka
-
Publication number: 20080195597Abstract: A searching system for a peer-to-peer network, for example, a cellular telephone network, where loads on each peer is limited, for example, by providing only a limited index on each peer.Type: ApplicationFiled: February 8, 2007Publication date: August 14, 2008Applicant: Samsung Electronics Co., Ltd.Inventors: Avi Rosenfeld, Gal A. Kaminka, Sarit Kraus
-
Patent number: 6449632Abstract: A system for collecting user feedback in a data broadcasting system, the system for collecting user feedback including a multiplicity of user profile agents, each user profile agent being associated with one of a multiplicity of users of the data broadcasting system and being operative to create a user profile based on activity of the one user, a user profile subsystem associated with a plurality of user profile agents chosen from among the multiplicity of user profile agents and operative to derive an integrated user profile based on the plurality of user profiles created by the plurality of user profile agents, and a broadcasting agent operatively associated with a broadcast center of the data broadcasting system and in operative communication with the user profile subsystem and receiving therefrom the integrated user profile.Type: GrantFiled: April 1, 1999Date of Patent: September 10, 2002Assignee: Bar Ilan University NDS LimitedInventors: Esther David, Shlomo Kipnis, Sarit Kraus, David Richardson