Stop the war!Остановите войну!
for scientists:
default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMarco Scarsini
Person information
- affiliation: Luiss University, Rome, Italy
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
Journal Articles
- 2024
[j42]Roberto Cominetti
, Valerio Dose, Marco Scarsini:
The price of anarchy in routing games as a function of the demand. Math. Program. 203(1): 531-558 (2024)- 2023
- [j41]Emilien Macault, Marco Scarsini, Tristan Tomala:
Corrigendum to "Social learning in nonatomic routing games" [Games Econ. Behav. 132 (2022) 221-233]. Games Econ. Behav. 138: 407-408 (2023) - [j40]Costis Maglaras, Marco Scarsini, Dongwook Shin, Stefano Vaccari:
Product Ranking in the Presence of Social Learning. Oper. Res. 71(4): 1136-1153 (2023) - [j39]Roberto Cominetti, Marco Scarsini, Marc Schröder, Nicolás E. Stier Moses:
Approximation and Convergence of Large Atomic Congestion Games. Math. Oper. Res. 48(2): 784-811 (2023) - 2022
- [j38]Emilien Macault, Marco Scarsini, Tristan Tomala:
Social learning in nonatomic routing games. Games Econ. Behav. 132: 221-233 (2022) - [j37]Alfred Müller, Marco Scarsini, Ilia Tsetlin, Robert L. Winkler:
Technical Note - Ranking Distributions When Only Means and Variances Are Known. Oper. Res. 70(5): 2851-2859 (2022) - [j36]Joseph M. Abdou, Nikolaos Pnevmatikos, Marco Scarsini, Xavier Venel:
Decomposition of Games: Some Strategic Considerations. Math. Oper. Res. 47(1): 176-208 (2022) - [j35]Roberto Cominetti, Matteo Quattropani, Marco Scarsini:
The Buck-Passing Game. Math. Oper. Res. 47(3): 1731-1756 (2022) - 2021
- [j34]Ben Amiet, Andrea Collevecchio, Marco Scarsini, Ziwen Zhong:
Pure Nash Equilibria and Best-Response Dynamics in Random Games. Math. Oper. Res. 46(4): 1552-1572 (2021) - 2020
- [j33]Tristan Garrec, Marco Scarsini:
Search for an immobile hider on a stochastic network. Eur. J. Oper. Res. 283(2): 783-794 (2020) - [j32]Riccardo Colini-Baldeschi, Roberto Cominetti, Panayotis Mertikopoulos, Marco Scarsini:
When Is Selfish Routing Bad? The Price of Anarchy in Light and Heavy Traffic. Oper. Res. 68(2): 411-434 (2020) - 2019
- [j31]Bar Ifrach, Costis Maglaras, Marco Scarsini, Anna Zseleva:
Bayesian Social Learning from Consumer Reviews. Oper. Res. 67(5): 1209-1221 (2019) - [j30]Gaëtan Fournier, Marco Scarsini:
Location Games on Networks: Existence and Efficiency of Equilibria. Math. Oper. Res. 44(1): 212-235 (2019) - [j29]Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini:
Price of Anarchy for Highly Congested Routing Games in Parallel Networks. Theory Comput. Syst. 63(1): 90-113 (2019) - 2018
- [j28]Marco Scarsini, Marc Schröder, Tristan Tomala:
Dynamic Atomic Congestion Games with Seasonal Flows. Oper. Res. 66(2): 327-339 (2018) - [j27]Omar Besbes, Marco Scarsini:
On Information Distortions in Online Ratings. Oper. Res. 66(3): 597-610 (2018) - 2017
- [j26]Alfred Müller, Marco Scarsini, Ilia Tsetlin, Robert L. Winkler:
Between First- and Second-Order Stochastic Dominance. Manag. Sci. 63(9): 2933-2947 (2017) - [j25]Davide Crapis, Bar Ifrach, Costis Maglaras, Marco Scarsini:
Monopoly Pricing in the Presence of Social Learning. Manag. Sci. 63(11): 3586-3608 (2017) - 2014
- [j24]Bar Ifrach, Costis Maglaras, Marco Scarsini:
Bayesian social learning with consumer reviews. SIGMETRICS Perform. Evaluation Rev. 41(4): 28 (2014) - 2013
- [j23]Ehud Lehrer, Marco Scarsini:
On the Core of Dynamic Cooperative Games. Dyn. Games Appl. 3(3): 359-373 (2013) - [j22]Valerio Capraro, Marco Scarsini:
Existence of equilibria in countable games: An algebraic approach. Games Econ. Behav. 79: 163-180 (2013) - 2012
- [j21]Marco Scarsini, Tristan Tomala:
Repeated congestion games with bounded rationality. Int. J. Game Theory 41(3): 651-669 (2012) - [j20]Alfred Müller, Marco Scarsini:
Fear of loss, inframodularity, and transfers. J. Econ. Theory 147(4): 1490-1500 (2012) - [j19]Yosef Rinott, Marco Scarsini, Yaming Yu:
A Colonel Blotto Gladiator Game. Math. Oper. Res. 37(4): 574-590 (2012) - 2010
- [j18]Giovanni Puccetti, Marco Scarsini:
Multivariate comonotonicity. J. Multivar. Anal. 101(1): 291-304 (2010) - 2009
- [j17]Alessandro Arlotto, Marco Scarsini:
Hessian orders and multinormal distributions. J. Multivar. Anal. 100(10): 2324-2330 (2009) - 2008
- [j16]Jérôme Renault, Sergio Scarlatti, Marco Scarsini:
Discounted and finitely repeated minority games with public signals. Math. Soc. Sci. 56(1): 44-74 (2008) - [j15]Jérôme Renault, Marco Scarsini, Tristan Tomala:
Playing off-line games with bounded rationality. Math. Soc. Sci. 56(2): 207-223 (2008) - 2007
- [j14]Luigi Montrucchio, Marco Scarsini:
Large newsvendor games. Games Econ. Behav. 58(2): 316-337 (2007) - [j13]Rose-Anne Dana, Marco Scarsini:
Optimal risk sharing with background risk. J. Econ. Theory 133(1): 152-176 (2007) - [j12]Jérôme Renault, Marco Scarsini, Tristan Tomala:
A Minority Game with Bounded Recall. Math. Oper. Res. 32(4): 873-889 (2007) - 2006
- [j11]Alfred Müller, Marco Scarsini:
Stochastic Order Relations and Lattices of Probability Measures. SIAM J. Optim. 16(4): 1024-1043 (2006) - 2005
- [j10]Jérôme Renault, Sergio Scarlatti, Marco Scarsini:
A folk theorem for minority games. Games Econ. Behav. 53(2): 208-230 (2005) - [j9]Salvatore Modica, Marco Scarsini:
A note on comparative downside risk aversion. J. Econ. Theory 122(2): 267-271 (2005) - 2003
- [j8]Bruno Bassan, Olivier Gossner, Marco Scarsini, Shmuel Zamir:
Positive value of information in games. Int. J. Game Theory 32(1): 17-31 (2003) - [j7]Alfred Müller, Marco Scarsini:
Sensitivity analysis of a sequential decision problem with learning. Math. Methods Oper. Res. 57(2): 321-327 (2003) - 2002
- [j6]Alfred Müller, Marco Scarsini, Moshe Shaked:
The Newsvendor Game Has a Nonempty Core. Games Econ. Behav. 38(1): 118-126 (2002) - 2001
- [j5]Alfred Müller, Marco Scarsini:
Stochastic Comparison of Random Vectors with a Common Copula. Math. Oper. Res. 26(4): 723-740 (2001) - 2000
- [j4]Marco Scarsini, Moshe Shaked:
On the value of an item subject to general repair or maintenance. Eur. J. Oper. Res. 122(3): 625-637 (2000) - [j3]Yosef Rinott, Marco Scarsini:
On the Number of Pure Strategy Nash Equilibria in Random Games. Games Econ. Behav. 33(2): 274-293 (2000) - 1991
- [j2]George L. O'Brien, Marco Scarsini:
Multivariate Stochastic Dominance and Moments. Math. Oper. Res. 16(2): 382-389 (1991) - 1987
- [j1]Marco Scarsini, Moshe Shaked:
Ordering distributions by scaled order statistics. Z. Oper. Research 31(1) (1987)
Conference and Workshop Papers
- 2023
- [c12]Nicolò Cesa-Bianchi, Tommaso Cesari, Takayuki Osogami, Marco Scarsini, Segev Wasserkrug:
Learning the Stackelberg Equilibrium in a Newsvendor Game. AAMAS 2023: 242-250 - 2022
- [c11]Etienne Boursier, Vianney Perchet, Marco Scarsini:
Social Learning in Non-Stationary Environments. ALT 2022: 128-129 - 2021
- [c10]Etienne Boursier, Tristan Garrec, Vianney Perchet, Marco Scarsini:
Making the most of your day: online learning for optimal allocation of time. NeurIPS 2021: 11208-11219 - [c9]Matteo Quattropani, Marco Scarsini:
Efficiency of Equilibria in Games with Random Payoffs. SAGT 2021: 412 - 2020
- [c8]Emilien Macault, Marco Scarsini, Tristan Tomala:
Bayesian Learning in Dynamic Nonatomic Routing Games. WINE 2020: 469 - 2019
- [c7]Roberto Cominetti, Marco Scarsini, Marc Schröder, Nicolás E. Stier Moses:
Price of Anarchy in Stochastic Atomic Congestion Games with Affine Costs. EC 2019: 579-580 - [c6]Roberto Cominetti, Valerio Dose, Marco Scarsini:
The Price of Anarchy in Routing Games as a Function of the Demand. WINE 2019: 337 - 2018
- [c5]Riccardo Colini-Baldeschi, Max Klimm, Marco Scarsini:
Demand-Independent Optimal Tolls. ICALP 2018: 151:1-151:14 - [c4]Stefano Vaccari, Costis Maglaras, Marco Scarsini:
Social Learning from Online Reviews with Product Choice. NetEcon@SIGMETRICS 2018: 8:1 - 2017
- [c3]Riccardo Colini-Baldeschi, Roberto Cominetti, Panayotis Mertikopoulos, Marco Scarsini:
The Asymptotic Behavior of the Price of Anarchy. WINE 2017: 133-145 - 2016
- [c2]Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini:
On the Price of Anarchy of Highly Congested Nonatomic Network Games. SAGT 2016: 117-128 - 2010
- [c1]Marco Scarsini, Tristan Tomala:
Repeated congestion games with bounded rationality. BQGT 2010: 5:1
Informal and Other Publications
- 2024
- [i27]Marco Scarsini, Eran Shmaya:
Optimal Queueing Regimes. CoRR abs/2401.13812 (2024) - 2023
- [i26]Lucas Baudin, Marco Scarsini, Xavier Venel:
Strategic Behavior and No-Regret Learning in Queueing Systems. CoRR abs/2302.03614 (2023) - [i25]Roberto Cominetti, Valerio Dose, Marco Scarsini:
Phase Transitions of the Price-of-Anarchy Function in Multi-Commodity Routing Games. CoRR abs/2305.03459 (2023) - [i24]Roberto Cominetti, Valerio Dose, Marco Scarsini:
Monotonicity of Equilibria in Nonatomic Congestion Games. CoRR abs/2308.00434 (2023) - 2022
- [i23]Nicolò Cesa-Bianchi, Tommaso Cesari, Takayuki Osogami, Marco Scarsini, Segev Wasserkrug:
Online Learning in Supply-Chain Games. CoRR abs/2207.04054 (2022) - [i22]Hlafo Alfie Mimun, Matteo Quattropani, Marco Scarsini:
Best-Response dynamics in two-person random games with correlated payoffs. CoRR abs/2209.12967 (2022) - 2021
- [i21]Etienne Boursier, Tristan Garrec, Vianney Perchet, Marco Scarsini:
Making the most of your day: online learning for optimal allocation of time. CoRR abs/2102.08087 (2021) - [i20]Frédéric Koessler, Marco Scarsini, Tristan Tomala:
Information Design in Large Games. CoRR abs/2107.06312 (2021) - 2020
- [i19]Roberto Cominetti, Marco Scarsini, Marc Schröder, Nicolás E. Stier Moses:
Convergence of Large Atomic Congestion Games. CoRR abs/2001.02797 (2020) - [i18]Matteo Quattropani, Marco Scarsini:
Efficiency of equilibria in random binary games. CoRR abs/2007.08518 (2020) - [i17]Etienne Boursier, Vianney Perchet, Marco Scarsini:
Speed of Social Learning from Reviews in Non-Stationary Environments. CoRR abs/2007.09996 (2020) - [i16]Emilien Macault, Marco Scarsini, Tristan Tomala:
Bayesian Learning in Dynamic Non-atomic Routing Games. CoRR abs/2009.11580 (2020) - 2019
- [i15]Joseph M. Abdou, Nikolaos Pnevmatikos, Marco Scarsini, Xavier Venel:
Decomposition of games: some strategic considerations. CoRR abs/1901.06048 (2019) - [i14]Roberto Cominetti, Marco Scarsini, Marc Schröder, Nicolás E. Stier Moses:
Price of Anarchy in Stochastic Atomic Congestion Games with Affine Costs. CoRR abs/1903.03309 (2019) - [i13]Tristan Garrec, Marco Scarsini:
When Sally Found Harry: A Stochastic Search Game. CoRR abs/1904.12852 (2019) - [i12]Ben Amiet, Andrea Collevecchio, Marco Scarsini:
Pure Nash Equilibria and Best-Response Dynamics in Random Games. CoRR abs/1905.10758 (2019) - [i11]Roberto Cominetti, Valerio Dose, Marco Scarsini:
The Price of Anarchy in Routing Games as a Function of the Demand. CoRR abs/1907.10101 (2019) - 2018
- [i10]Roberto Cominetti, Matteo Quattropani, Marco Scarsini:
The Buck-Passing Game. CoRR abs/1808.03206 (2018) - 2017
- [i9]Riccardo Colini-Baldeschi, Roberto Cominetti, Panayotis Mertikopoulos, Marco Scarsini:
On the asymptotic behavior of the price of anarchy: Is selfish routing bad in highly congested networks? CoRR abs/1703.00927 (2017) - [i8]Riccardo Colini-Baldeschi, Max Klimm, Marco Scarsini:
Demand-Independent Tolls. CoRR abs/1708.02737 (2017) - 2016
- [i7]Gaëtan Fournier, Marco Scarsini:
Hotelling Games on Networks: Existence and Efficiency of Equilibria. CoRR abs/1601.07414 (2016) - [i6]Riccardo Colini-Baldeschi, Roberto Cominetti, Marco Scarsini:
On the Price of Anarchy of Highly Congested Nonatomic Network Games. CoRR abs/1605.03081 (2016) - [i5]Marco Scarsini, Marc Schröder, Tristan Tomala:
Dynamic Atomic Congestion Games with Seasonal Flows. CoRR abs/1606.05691 (2016) - [i4]Riccardo Colini-Baldeschi, Marco Scarsini, Stefano Vaccari:
Variance Allocation and Shapley Value. CoRR abs/1606.09424 (2016) - 2012
- [i3]Valerio Capraro, Marco Scarsini:
Existence of equilibria in countable games: an algebraic approach. CoRR abs/1203.2301 (2012) - [i2]Ehud Lehrer, Marco Scarsini:
On the Core of Dynamic Cooperative Games. CoRR abs/1203.2832 (2012) - [i1]Yosef Rinott, Marco Scarsini, Yaming Yu:
A Colonel Blotto Gladiator Game. CoRR abs/1205.5788 (2012)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-05-08 23:58 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
