Alpern Steve

Steve Alpern

Information about the author Steve Alpern will soon be added to the site.
Found 22 papers in total
Who should cast the casting vote? Using sequential voting to amalgamate information
Who should cast the casting vote? Using sequential voting to amalgamate information
2017
In this study, we are concerned with how agents can best amalgamate their private...
The Secretary Problem with a Selection Committee: Do Conformist Committees Hire Better Secretaries?
The Secretary Problem with a Selection Committee: Do Conformist Committees Hire Better Secretaries?
2017
This paper analyzes a variation of the secretary problem in which two selectors with...
Patrolling a Border
Patrolling a Border
2016
Patrolling games were recently introduced to model the problem of protecting the nodes...
Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object
Optimal Trade-Off Between Speed and Acuity When Searching for a Small Object
2015
A Searcher seeks to find a stationary Hider located at some point H (not necessarily a...
Accumulation games on graphs
Accumulation games on graphs
2014
Accumulation games on discrete locations were introduced by Ruckle and Kikuta. The...
A Proof of the Kikuta–Ruckle Conjecture on Cyclic Caching of Resources
A Proof of the Kikuta–Ruckle Conjecture on Cyclic Caching of Resources
2012
Suppose that a hider possesses a continuously divisible resource that he may...
A New Approach to Gal’s Theory of Search Games on Weakly Eulerian Networks
A New Approach to Gal’s Theory of Search Games on Weakly Eulerian Networks
2011
A network is called weakly Eulerian if it consists of a finite number of disjoint...
Analysis and design of selection committees: a game theoretic secretary problem
Analysis and design of selection committees: a game theoretic secretary problem
2009
Firms often delegate important decisions to committees which are set up specifically...
Hide-and-seek games on a tree to which Eulerian networks are attached
Hide-and-seek games on a tree to which Eulerian networks are attached
2008
We analyze the hide-and-seek game ⌈( G ) on certain networks G . The hider picks...
Searching symmetric networks with Utilitarian-Postman paths
Searching symmetric networks with Utilitarian-Postman paths
2009
We introduce the notion of a Utilitarian Postman (UP) path on a network Q as one which...
A common notion of clockwise can help in planar rendezvous
A common notion of clockwise can help in planar rendezvous
2006
Two players are lost in a grid of city streets and wish to meet as soon as possible....
Rendezvous on a planar lattice
Rendezvous on a planar lattice
2005
We analyze the optimal behavior of two players who are lost on a planar surface and...
Searching for an agent who may or may not want to be found
Searching for an agent who may or may not want to be found
2002
There is an extensive theory regarding optimal continuous path search for a mobile or...
Rendezvous search: A personal perspective
Rendezvous search: A personal perspective
2002
The rendezvous-search problem was posed by the author 25 years ago. In its basic form,...
Rendezvous of three agents on the line
Rendezvous of three agents on the line
2002
This paper considers a three-person rendezvous problem on the line which was...
Rendezvous search on labeled networks
Rendezvous search on labeled networks
2002
Two players are independently placed on a commonly labelled network X . They cannot...
Pure strategy asymmetric rendezvous on the line with an unknown initial distance
Pure strategy asymmetric rendezvous on the line with an unknown initial distance
2000
Suppose two blind agents with unit speed are placed a distance H apart on an infinite...
The symmetric rendezvous-evasion game
The symmetric rendezvous-evasion game
1998
E.J. Anderson and R.R. Weber considered the problem of two rendezvousers, R 1 , R 2 ,...
Rendezvous search on the line with limited resources: Maximizing the probability of meeting
Rendezvous search on the line with limited resources: Maximizing the probability of meeting
1999
Two players are placed on a line at a distance d which is drawn from a known...
Rendezvous search on the line with bounded resources: Expected time minimization
Rendezvous search on the line with bounded resources: Expected time minimization
1997
Two players are placed on the line and want to meet. Neither knows the direction of...
Geometric search theory and demand uncertainty
Geometric search theory and demand uncertainty
1989
Recently D.J. Snower and the author have considered several models whereby a...
A search model of optimal pricing and production
A search model of optimal pricing and production
1989
This paper aims to capture the idea that the firm learns about its demand curve...
Papers per page: