A Silverman game is a two-person zero-sum game defined in terms of two sets S I and S II of positive numbers, and two parameters, the threshold T > 1 and the penalty v > 0. Players I and II independently choose numbers from S I and S II, respectively. The higher number wins 1, unless it is at least T times as large as the other, in which case it loses v. Equal numbers tie. Such a game might be used to model various bidding or spending situations in which within some bounds the higher bidder or bigger spender wins, but loses if it is overdone. Such situations may include spending on armaments, advertising spending or sealed bids in an auction. Previous work has dealt mainly with special cases. In this work recent progress for arbitrary discrete sets S I and S II is presented. Under quite general conditions, these games reduce to finite matrix games. A large class of games are completely determined by the diagonal of the matrix, and it is shown how the great majority of these appear to have unique optimal strategies. The work is accessible to all who are familiar with basic noncooperative game theory.
Les informations fournies dans la section « Synopsis » peuvent faire référence à une autre édition de ce titre.
A Silverman game is a two-person zero-sum game defined in terms of two sets S I and S II of positive numbers, and two parameters, the threshold T > 1 and the penalty v > 0. Players I and II independently choose numbers from S I and S II, respectively. The higher number wins 1, unless it is at least T times as large as the other, in which case it loses v. Equal numbers tie. Such a game might be used to model various bidding or spending situations in which within some bounds the higher bidder or bigger spender wins, but loses if it is overdone. Such situations may include spending on armaments, advertising spending or sealed bids in an auction. Previous work has dealt mainly with special cases. In this work recent progress for arbitrary discrete sets S I and S II is presented. Under quite general conditions, these games reduce to finite matrix games. A large class of games are completely determined by the diagonal of the matrix, and it is shown how the great majority of these appear to have unique optimal strategies. The work is accessible to all who are familiar with basic noncooperative game theory.
Les informations fournies dans la section « A propos du livre » peuvent faire référence à une autre édition de ce titre.
Vendeur : Zubal-Books, Since 1961, Cleveland, OH, Etats-Unis
Etat : Fine. *FREE domestic shipping until Monday, October. 19* 140 pp., Paperback, fine. - If you are reading this, this item is actually (physically) in our stock and ready for shipment once ordered. We are not bookjackers. Buyer is responsible for any additional duties, taxes, or fees required by recipient's country. N° de réf. du vendeur ZB920999
Quantité disponible : 1 disponible(s)
Vendeur : Chiron Media, Wallingford, Royaume-Uni
PF. Etat : New. This item is printed on demand. Brand new book, sourced directly from publisher. Dispatch time is 6-7 days from our warehouse. Book will be sent in robust, secure packaging to ensure it reaches you securely. N° de réf. du vendeur 6666-IUK-9783540543725
Quantité disponible : 20 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : As New. Unread book in perfect condition. N° de réf. du vendeur 19200383
Quantité disponible : 15 disponible(s)
Vendeur : GreatBookPrices, Columbia, MD, Etats-Unis
Etat : New. N° de réf. du vendeur 19200383-n
Quantité disponible : 15 disponible(s)
Vendeur : Ria Christie Collections, Uxbridge, Royaume-Uni
Etat : New. In English. N° de réf. du vendeur ria9783540543725_new
Quantité disponible : Plus de 20 disponibles
Vendeur : Books Puddle, Woodside, NY, Etats-Unis
Etat : New. pp. v + 140 Softcover Reprint of the Original 1st Edition 1991. N° de réf. du vendeur 2658594236
Quantité disponible : 4 disponible(s)
Vendeur : Majestic Books, Hounslow, Royaume-Uni
Etat : New. Print on Demand pp. v + 140 26 Figures. N° de réf. du vendeur 50965603
Quantité disponible : 4 disponible(s)
Vendeur : Revaluation Books, Exeter, Royaume-Uni
Paperback. Etat : Brand New. 140 pages. 9.53x6.69x0.35 inches. In Stock. N° de réf. du vendeur x-3540543724
Quantité disponible : 2 disponible(s)
Vendeur : Biblios, Frankfurt am main, HESSE, Allemagne
Etat : New. PRINT ON DEMAND pp. v + 140. N° de réf. du vendeur 1858594230
Quantité disponible : 4 disponible(s)
Vendeur : AHA-BUCH GmbH, Einbeck, Allemagne
Taschenbuch. Etat : Neu. Druck auf Anfrage Neuware - Printed after ordering - A Silverman game is a two-person zero-sum game defined in terms of two sets S I and S II of positive numbers, and two parameters, the threshold T 1 and the penalty v 0. Players I and II independently choose numbers from S I and S II, respectively. The higher number wins 1, unless it is at least T times as large as the other, in which case it loses v. Equal numbers tie. Such a game might be used to model various bidding or spending situations in which within some bounds the higher bidder or bigger spender wins, but loses if it is overdone. Such situations may include spending on armaments, advertising spending or sealed bids in an auction. Previous work has dealt mainly with special cases. In this work recent progress for arbitrary discrete sets S I and S II is presented. Under quite general conditions, these games reduce to finite matrix games. A large class of games are completely determined by the diagonal of the matrix, and it is shown how the great majority of these appear to have unique optimal strategies. The work is accessible to all who are familiar with basic noncooperative game theory. N° de réf. du vendeur 9783540543725
Quantité disponible : 1 disponible(s)