![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Michael Benisch
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 2014
- [i1]Michael Benisch, George B. Davis, Tuomas Sandholm:
Algorithms for Closed Under Rational Behavior (CURB) Sets. CoRR abs/1401.3855 (2014) - 2013
- [j7]Jialiu Lin, Michael Benisch, Norman M. Sadeh
, Jianwei Niu, Jason I. Hong
, Banghui Lu, Shaohui Guo:
A comparative study of location-sharing privacy preferences in the United States and China. Pers. Ubiquitous Comput. 17(4): 697-711 (2013) - 2011
- [j6]Michael Benisch, Patrick Gage Kelley, Norman M. Sadeh
, Lorrie Faith Cranor
:
Capturing location-privacy preferences: quantifying accuracy and user-burden tradeoffs. Pers. Ubiquitous Comput. 15(7): 679-694 (2011) - [c17]Michael Benisch, Tuomas Sandholm:
A Framework for Automated Bundling and Pricing Using Purchase Data. AMMA 2011: 40-52 - [c16]Patrick Gage Kelley, Michael Benisch, Lorrie Faith Cranor
, Norman M. Sadeh
:
When are users comfortable sharing locations with advertisers? CHI 2011: 2449-2452 - [c15]Jayant Venkatanathan, Denzil Ferreira
, Michael Benisch, Jialiu Lin, Evangelos Karapanos
, Vassilis Kostakos
, Norman M. Sadeh
, Eran Toch
:
Improving Users' Consistency When Recalling Location Sharing Preferences. INTERACT (1) 2011: 380-387 - 2010
- [j5]Michael Benisch, George B. Davis, Tuomas Sandholm:
Algorithms for Closed Under Rational Behavior (CURB) Sets. J. Artif. Intell. Res. 38: 513-534 (2010)
2000 – 2009
- 2009
- [j4]Michael Benisch, Alberto Sardinha
, James Andrews, Ramprasad Ravichandran, Norman M. Sadeh
:
CMieux: Adaptive strategies for competitive supply chain trading. Electron. Commer. Res. Appl. 8(2): 78-90 (2009) - [j3]Alberto Sardinha
, Michael Benisch, Norman M. Sadeh
, Ramprasad Ravichandran, Vedran Podobnik, Mihai Stan:
The 2007 procurement challenge: A competition to evaluate mixed procurement strategies. Electron. Commer. Res. Appl. 8(2): 106-114 (2009) - [c14]Michael Benisch, Norman M. Sadeh, Tuomas Sandholm:
Methodology for Designing Reasonably Expressive Mechanisms with Application to Ad Auctions. IJCAI 2009: 46-52 - [c13]Ramprasad Ravichandran, Michael Benisch, Patrick Gage Kelley, Norman M. Sadeh
:
Capturing Social Networking Privacy Preferences: Can Default Policies Help Alleviate Tradeoffs between Expressiveness and User Burden? Privacy Enhancing Technologies 2009: 1-18 - [c12]Michael Benisch, Patrick Gage Kelley, Norman M. Sadeh, Tuomas Sandholm, Janice Y. Tsai, Lorrie Faith Cranor, Paul Hankes Drielsma:
The impact of expressiveness on the effectiveness of privacy mechanisms for location-sharing. SOUPS 2009 - [c11]Ramprasad Ravichandran, Michael Benisch, Patrick Gage Kelley, Norman M. Sadeh:
Capturing social networking privacy preferences: can default policies help alleviate tradeoffs between expressiveness and user burden? SOUPS 2009 - 2008
- [c10]Michael Benisch, Norman M. Sadeh, Tuomas Sandholm:
A Theory of Expressiveness in Mechanisms. AAAI 2008: 17-23 - 2007
- [c9]George B. Davis, Michael Benisch, Kathleen M. Carley
, Norman M. Sadeh
:
Factoring games to isolate strategic interactions. AAMAS 2007: 68 - [c8]James Andrews, Michael Benisch, Alberto Sardinha, Norman M. Sadeh:
Using Information Gain to Analyze and Fine Tune the Performance of Supply Chain Trading Agents. AMEC/TADA 2007: 182-199 - 2006
- [j2]Michael Benisch, Alberto Sardinha, James Andrews, Norman M. Sadeh:
CMieux: adaptive strategies for competitive supply chain trading. SIGecom Exch. 6(1): 1-10 (2006) - [c7]Michael Benisch, James Andrews, Norman M. Sadeh
:
Pricing for customers with probabilistic valuations as a continuous knapsack problem. ICEC 2006: 38-46 - [c6]Michael Benisch, Alberto Sardinha
, James Andrews, Norman M. Sadeh
:
CMieux: adaptive strategies for competitive supply chain trading. ICEC 2006: 47-58 - [c5]Michael Benisch, George B. Davis, Tuomas Sandholm:
Algorithms for Rationalizability and CURB Sets. AAAI 2006: 598-604 - [c4]Michael Benisch, James Andrews, Norman M. Sadeh:
Adaptive Pricing for Customers with Probabilistic Valuations. TADA/AMEC 2006: 132-148 - [c3]Michael Benisch, Norman M. Sadeh
:
Examining DCSP coordination tradeoffs. AAMAS 2006: 1405-1412 - 2004
- [j1]Michael Benisch, Amy Greenwald, Ioanna Grypari
, Roger Lederman, Victor Naroditskiy, Michael Carl Tschantz:
Botticelli: a supply chain management agent designed to optimize under uncertainty. SIGecom Exch. 4(3): 29-37 (2004) - [c2]Michael Benisch, Amy Greenwald, Ioanna Grypari, Roger Lederman, Victor Naroditskiy, Michael Carl Tschantz:
Botticelli: A Supply Chain Management Agent. AAMAS 2004: 1174-1181 - [c1]Michael Benisch, Amy Greenwald
, Victor Naroditskiy, Michael Carl Tschantz:
A stochastic programming approach to scheduling in TAC SCM. EC 2004: 152-159
Coauthor Index
![](https://dblp.uni-trier.de/img/cog.dark.24x24.png)
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 21:51 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint